11. Chapter 11: Binary Search Trees

• 11.1. Representing Sets via Binary Search Trees
  • 11.1.1. A Data Structure for Binary-Search Trees
  • 11.1.2. Inserting an element into a BST
  • 11.1.3. Binary-Search-Tree Invariant
  • 11.1.4. Testing Tree Operations
  • 11.1.5. Printing a Tree
  • 11.1.6. Searching Elements
  • 11.1.7. Tree Traversals
  • 11.1.8. Testing Element Retrieval and Tree Traversals
  • 11.1.9. More BST operations
  • 11.1.10. Deleting a node from BST
  • 11.1.11. BST Rotations