Jan. 2015.pptVIP

btrees - * Jan. 2015 Binary Search Trees What is a search binary tree? Inorder search of a binary search tree Find Min Max Predecessor and successor BST insertion and deletion Binary Trees Recursive definition An empty tree is a binary tree A node with two child subtrees is a binary tree Let A and B be two binary trees. A tree with root r, and A and B as its left and right subtrees, respectively, is a binary tree. Is this a binary tree? 56 26 200 18 28 190 213 12 24 27 Binary Search Trees A BST is a data structures that can support dynamic set operations. Search, Minimum, Maximum, Predecessor, Successor, Insert, and Delete. Can be used to build Dictionaries. Priority Queues. Basic operations take time proportional to the height of the tree – O(h). BST – Representation Represented by a linked data structure of nodes. root(T) points to the root of tree T. Each node contains fields: key left – pointer to left child: root of left subtree. right – pointer to right child : root of right subtree. p – pointer to parent. p[root[T]] = NIL (optional). Binary Search Tree Property Stored keys must satisfy the binary search tree property. ? y in left subtree of x, then key[y] key[x]. ? y in right subtree of x, then key[y] ? key[x]. 56 26 200 18 28 190 213 12 24 27 Inorder Traversal Inorder-Tree-Walk (x) 1. if x ? NIL 2. then Inorder-Tree-Walk(left[p]) 3. print key[x] 4. Inorder-Tree-Walk(right[p]) How long does the walk take? Can you prove its correctness? The binary-search-tree property allows the keys of a binary search tree to be printed, in (monotonically increasing) order, recursively. 56 26 200 18 28 190 213 12 24 27 Correctness of Inorder-Walk Must prove that it prints all elements, in order, and that it terminates. By induction on size of tree. Size=0: Easy. Size 1: Prints left subtree in order by induction. Prints root, which comes after all elements in left subtree (still in order). Prints right subtree in order (all elements co