This video shows how to delete items from a binary search tree (BST). It builds on the search algorithm covered in Part 1, and uses several examples to illustrate the complete set of deletion scenarios. These examples serve as a template for constructing the deletion algorithm, and implementing it in Java. Several code-compaction techniques are used to make the implementation as concise as possible.