程式设计与算法基础().pptVIP

程序设计与算法基础(4) 潘爱民 2006/10/16 Outline tree tree Binary search tree Tree traversal Insertion in a binary tree Deleting in a binary tree Balancing a tree Splay tree Heap trees The tree in real world The tree in computer science Hierarchical structures in real world Corporation organization University organization Mail dispatching Internet The data structures The linear data structure Array Linked list In essence, stack and queue operate on a linear structure Tree is a non-linear data structure A formal definition of tree A tree consists of nodes and arcs 1. An empty structure is an empty tree 2. If t1, …, tk, are disjoint trees, then the structure whose root has as its children the roots of t1, ..., tk is also a tree. 3. Only structures generated by rules 1 and 2 are trees. Examples of trees The terms in a tree Root: the top element if not an empty tree Children, parent Grandparent, siblings, … Path (for a node): a unique sequence of arcs from root to a node Length (for a path): the number of arcs in a path Level (for a node): the length of the path from the root to the node plus 1, i.e. the number of nodes in the path Height (for a tree): the maximum level of a node in the tree For the empty tree, the height is 0 For the tree with a single node, the height is 1 levels Notes about levels Some texts start level numbers at 0 rather than at 1 Root is at level 1. Its children are at level 2. The grand children of the root are at level 3. And so on. height = depth = number of levels Node Degree  = Number Of Children Tree Degree  = Max Node Degree A binary tree Definition A binary tree is a tree whose nodes have at most two children (possibly empty) And each child is designed as either a left child or a right child Properties of a binary tree Minimum number of nodes in a binary tree whose height is h is h Maximum number of nodes in a binary tree whose height is h is 2h-1 If n is the number of nodes in a binary tree whose height is h, thenh = n = 2h – 1 A complete bin