Part 3 | Search Trees

• Objectives
• To read
• Exercises A
  • Exercise 3.1.1
  • Exercise 3.1.3
  • Exercise 3.1.4
  • Exercise 3.1.5
  • Exercise 3.1.6
  • Exercise 3.1.7
  • Exercise 3.1.8
  • Exercise 3.1.9
  • Exercise 3.1.10
  • Exercise 3.1.11 (INGInious MCQ on tree traversals)
  • Exercise 3.1.12 (INGInious: BST Iterator)
  • Exercise 3.1.13 (INGInious: Ceil)
  • Exercise 3.1.14 (INGInious: Higher key)
  • Exercise 3.1.15 (INGInious MCQ on BST Time-Complexity)
  • Exercise 3.1.16 (INGInious: Small exercises on red-black)
  • Exercise 3.1.17 (INGInious: Red-Black Tree Conversion)
• Exercises B
  • Exercise 3.2.1 (True/False)
  • Exercise 3.2.2 (Sorting with BST)
  • Exercise 3.2.3 (Delete Complexity)
  • Exercise 3.2.4 (Delete Commutativity)
  • Exercise 3.2.5 (INGInious: BST Serialization)
  • Exercise 3.2.6 (INGInious: BirthdayMap)
  • Exercise 3.2.7 (INGInious: Skyline)
  • Exercise 3.2.8 (INGInious: Array BST, put and get)
  • Exercise 3.2.9 (INGInious: Array BST, delete)