1/27/2003
CS2 Week 7
2
Recall - Binary Search Tree
•A Binary Tree such that:
•Every node entry has a unique key.
•All the keys in the left subtree of a node are less than the key of the node. •All the keys in the right subtree of a node are greater than the key of the node.