Description: Tree is n (n ≥ 0) consisting of nodes finite set T. n = 0 of the tree known as the empty tree for n> 0 of the tree, there is: (1) has only one special node called the root node, root node there is no precursor node (2) when n> 1 when, with the exception of root node except the node is divided into m (m> 0) a finite set of mutually exclusive cross-T1, T2, ..., Tm, one of each set Ti is itself a structure and are similar subtree tree .
To Search:
File list (Check if you may need any files):
2008638621518.ppt
Download