TREES
Trees is a non-linear data structure that is suitable fro representing hierarrchical relationship.trees are very flexible and powerful that can be used for a wide variety of applications.A tree ‘T’may be defined as a finite non empty set of elements called nodes such that :
->there is a special node called root of the tree.
->The remaining nodes are partitioned into zero or more disjoint subsets T1,T2,T3………Tn where(n>=0).Each of these subsets is a tree itself.
-> The subsets T1,T2,T3………Tn are called subtrees of the root.
-> The Definition is recursive as subsets T1,T2,T3…………Tn are trees.
-> Each tree has a single root.
->The remaining nodes are partitioned into zero or more disjoint subsets T1,T2,T3………Tn where(n>=0).Each of these subsets is a tree itself.
-> The subsets T1,T2,T3………Tn are called subtrees of the root.
-> The Definition is recursive as subsets T1,T2,T3…………Tn are trees.
-> Each tree has a single root.
No comments:
Post a Comment