Lecture 19: Search Tables, Binary Search Trees [Advanced Data Structures]

We continue our discussion of Ordered Dictionaries, and begin our discussion of Binary Search Trees. We begin by defining Binary Search Trees through proper binary trees, give properties of these trees, some ways to represent binary search trees, and a few operations on binary search trees. We will wrap up our discussions on the remainder of the major operations in the next lectures.

Remark: When I speak at 4:48, I meant every INTERNAL node has exactly two children, leaves have no children. I correct myself the next sentence, but I feel the need to mention this.

Want the notes, and/or want to support my mission? Look no further, get the written companion to this video lectures series. Buy the book, Advanced Data Structures: An Introduction to Data Structures and Algorithms, it is available at the below links (by format, given in parentheses):

Supporters (to date of publication, by tier):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Tor Asbjørn Bekkelund
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:

Time Stamps:
0:00 What is an ordered dictionary? Reminder.
0:35 Search Table (Sorted Array)
4:36 Proper Binary Tree
5:44 Properties of Proper Binary Trees
8:00 Definition of Binary Search Tree
12:30 Implementations of a Binary Search Tree
22:55 How do you handle duplicate keys, if needed?
27:51 Inorder traversal
32:26 Computing the record with the smallest key (smallest)
44:05 Getting a record with a given key (get)

#Algorithms
#ComputerScience
#DataStructures