Trees in data structure
A tree is recursively defined as a set of one or more nodes where one node is designated as the root of the tree and all the remaining nodes can be partitioned into non-empty sets each of which is a sub-tree of the root. Basic Terminology Root node The root node R is the topmost … Read more