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
- Exercics 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 exercices on red-black)
- Exercise 3.1.17 (Inginious: Red-Black Tree Conversion)
- Exercises B
- Exercice 3.2.1 (True/False BinarySearch)
- Exercice 3.2.2 (True/False BST)
- Exercice 3.2.3 (True/False Redblack Trees)
- 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)
