Binary Search Tree

After reading this chapter and engaging in the embedded activities and reflections, you should be able to:

• Illustrate the decision tree corresponding to the binary search process.
• Identify the various components of a (rooted) tree structure.
• Differentiate general (rooted) tree from a binary tree.
• Recognize the recursive nature of the tree structure.
• Differentiate binary trees from binary search trees based on the complete ordering property.
• Recognize a tree as a non-linear linked structure.
• Explain and trace the core operations of a Binary Search Tree.
• Implement the core operations of an OrderedSet efficiently with a Binary Search Tree.

Starter code for this chapter