Queries, insertion, deletion, modification, height, performance.
Introduction to the Tree abstract data type.
Trees, tree traversal, spanning trees, minimum spanning trees, Huffman encoding, Prim’s and Kruskal’s algorithms.
Basic qualitative facts about BSTs
Screencast Suthers 15 min
How to perform queries on BSTs
Screencast Suthers 22 min
How to modify binary search trees.
Screencast Suthers 21 min
Determine the height of binary search trees.
Screencast Suthers 5 min
What is a binary search tree; querying, insertion, and deletion.
Textbook 13 pages
Notes on binary search trees
Notes
Apply your learning about binary trees some more.
Homework
Provide four implementations of the Dynamic Set ADT and compare their performance.
Programming
