Ch04TREES(数据结构外文版).ppt

See how trees are used to implement the file system of several popular operating systems. See how trees can be used to evaluate arithmetic expressions. Show how to use trees to support searching operations in O(log n) average time, and how to refine these ideas to obtain O(log n) worst-case bounds. * CHAPTER 4TREES Data Structures And Algorithm Analysis In C §1 Preliminaries 1. Terminology Lineal Tree Pedigree Tree ( binary tree ) §1 Preliminaries 【Definition】A tree is a collection of nodes. The collection can be empty; otherwise, a tree consists of (1) a distinguished node r, called the root; (2) and zero or more nonempty (sub)trees T1, ???, Tk, each of whose roots are connected by a directed edge from r. Note: ? Subtrees must not connect together. Therefore every node in the tree is the root of some subtree. ? There are edges in a tree with N nodes. ? Normally the root is drawn at the top. N ? 1 A C B D G F E H I J M L K ? degree of a node ::= number of subtrees of the node. For example, degree(A) = 3, degree(F) = 0. ? degree of a tree ::= For example, degree of this tree = 3. ? leaf ( terminal node ) ::= a node with degree 0 (no children). ? parent ::= a node that has subtrees. ? children ::= the roots of the subtrees of a parent. ? siblings ::= children of the same parent. §1 Preliminaries §1 Preliminaries A C B D G F E H I J M L K ? ancestors of a node ::= all the nodes along the path from the node up to the root. ? descendants of a node ::= all the nodes in its subtrees. ? depth of ni ::= length of the unique path from the root to ni. Depth(root) = 0. ? height of ni ::= length of the longest path from ni to a leaf. Height(leaf) = 0, and height(D) = 2. ? height (depth) of a tree ::= height(root) = depth(deepest leaf). ? path from n1 to nk ::= a (unique) sequence of nodes n1, n2, …, nk such that ni is the parent of ni+1 for 1 ? i k. ? length of path ::= number of edges on the path. 2. Implementation ?