14.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

14.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

Note: there is an alphebetical error on slide 8, UX Designer and Web Developer should be switched.

14.4.3. Checkpoint 1¶

14.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

14.4.5. Checkpoint 2¶

14.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

14.4.7. Checkpoint 3¶

14.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

14.4.9. Checkpoint 4¶