[工学]数据结构精品课程ppt10.pptVIP

1. Tree Structures Tree Structures Tree Structures Tree Node Level and Path Length Tree Node Level and Path Length – Depth Discussion Tree Node Level and Path Length – Depth Discussion Tree Node Level and Path Length – Depth Discussion Tree Node Level and Path Length – Depth Discussion Binary Tree Definition A binary tree T is a finite set of nodes with one of the following properties: (a) T is a tree if the set of nodes is empty. (An empty tree is a tree.) (b) The set consists of a root, R, and exactly two distinct binary trees, the left subtree TL and the right subtreeTR. The nodes in T consist of node R and all the nodes in TL and TR. 注：1.二叉树和分支为２的树 2.多叉树、森林概念 Binary Tree Definition 树转换为二叉树 Selected Samples of Binary Trees Evaluating Tree Density For complete binarytree: Level 0: 20 Level 1: 21 … Level d-1: 2d-1 total d-1 levels: 1+2+3…+ 2d-1 = 2d-1 Level d: 2d-1+1= 2d n 层Complete binarytree: 2d-1+2d=2d+1-1 2d≦n ≦ 2d+1-1 2d+1 ? d ≦log2n d+1 注：二叉树的性质 2.Binary Tree Nodes Build Tree Nodes template typename T class tnode { public: T nodeValue; tnodeT *left, *right; tnode(){} tnode (const T item, tnodeT *lptr = NULL, tnodeT *rptr = NULL): nodeValue(item), left(lptr), right(rptr) {} }; Build Tree tnodechar *buildTree(int n) { tnodechar *root, *b, *c, *d, *e, *f, *g, *h, *i; switch(n) {case 0: d = new tnodechar (D); e = new tnodechar (E); b = new tnodechar (B,(tnodechar *)NULL, d); c = new tnodechar (C,e, (tnodechar *)NULL); root = new tnodechar (A,b, c); break; Build Tree case 1: g = new tnodechar (G); h = new tnodechar (H); i = new tnodechar (I); d = new tnodechar (D); e = new tnodechar (E,g, (tnodechar *)NULL); f = new tnodechar (F,h, i); b = new tnodechar (B,d, e); c = new tnodechar (C,(tnodechar *)NULL, f); root = new tnodechar (A,b, c); break; Build Tree case 2: g = new tnodechar (G); h = new tnodechar (H); i = new tnodechar (I); d = ne