10.4. Binary Search Trees¶
10.4.1. Objectives¶
Distinguish a Binary Tree from a Binary Search Tree (BST)
Describe the characteristics of a Binary Search Tree and the efficiency its operations
Traverse a Binary Search Tree
Implement and use a Binary Search Tree ADT
Add an a new entry to a Binary Search Tree
Remove an entry from a Binary Search Tree
10.4.1.1. Suggested Reading:¶
Chapter 25 A Binary Search Tree Implementation from Data Structures and Abstractions with Java, 4th edition by Frank M. Carrano and Timothy Henry
10.4.2. Interactive: Introduction to Binary Search Trees¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
IntroBinarySearchTrees.pdf
10.4.3. Checkpoint 1¶
10.4.4. Interactive: Programming Binary Search Trees¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
ProgrammingBinarySearchTrees.pdf
10.4.5. Checkpoint 2¶
10.4.6. Interactive: Adding Binary Search Trees¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
AddingToBinarySearchTrees.pdf
10.4.7. Checkpoint 3¶
10.4.8. Interactive: Removing From Binary Search Trees¶
Follow Along and Engage
Download the slides corresponding to the video. Take notes on them as you watch the video, practice drawing diagrams yourself!
RemovingFromBinarySearchTrees.pdf
