Version: 0.3.38
2. Binary Search Tree#
- Lecture:
Lecture 5.2
(slides)
- Objectives:
Understand how to implement a binary search tree
- Concepts:
Ordered Set ADT, insertion, deletion, min/max, predecessor/successor in a BST
To be completed
Hi there! What do you think of this course, so far? Please, give us feedback!