Binary Search Trees

This is an introduction to binary search trees including queries (Search, Minimum, Maximum, Successor, Predecessor) and modifying operations (insert and delete). How to balance a search tree is treated in a separate video.

0:00 Dynamic Ordered Sets
1:16 Binary Search Trees
2:32 Tree Terminology
4:53 Storing a Binary tree
6:35 Binary-Search-Tree property
9:12 Tree Walks
10:00 Inorder Tree Walk
15:00 Queries: Tree Search
18:09 Minimum and Maximum
19:53 Successor and Predecessor
27:02 Inserting into a Binary Search Tree
30:20 Deleting a node
32:55 Wrap-Up