第7次上机作业题目.docVIP

Implement Your Own BST Prerequisites, Goals, and Outcomes Prerequisites: Students should have mastered the following prerequisite skills. Binary Search Tree - Knowledge of Binary Search Tree and some operations of BST Goals: This assignment is designed to reinforce the students understanding of the store and basic operations of BST. Outcomes: Students successfully completing this assignment would master the following outcomes. Understand the BST and its implementation Background Binary Search Tree Binary Search tree is a binary tree in which each internal node x stores an element such that the element stored in the left subtree of x are less than or equal to x and elements stored in the right subtree of x are greater than or equal to x. This is called binary-search-tree property. The basic operations on a binary search tree take time proportional to the height of the tree. For a complete binary tree with node n, such operations run in worst-case time. If the tree is a linear chain of n nodes, however, the same operations takes worst-case time. Implementation of Binary Search Tree Binary Search Tree can be implemented as a linked data structure in which each node is an object with two pointer fields. The three pointer fields left, right corresponding to the left child, right child respectively NIL in any pointer field signifies that there exists no corresponding child. Fig 1. Linked Storage Structure of BST Querying a Binary Search Tree The most common operations performed on a BST are searching for a key stored in the tree. Other operations are MINIMUM, MAXIMUM, SUCCESSOR and PREDESESSOR. These operations run in O (h) time where h is the height of the tree i.e., h is the number of links root node to the deepest node. The TREE-SEARCH (x, k) algorithm searches the tree root at x for a node whose key value equals k. It returns a pointer to the node if it exists, otherwise NIL TREE-SEARCH (x, k) if x = NIL?? .OR. ?? k = key[x] then return x if k key[x] ??? then r