Deletion in a Binary Search Tree
In this lesson, we are going to learn how nodes are deleted in binary search trees. We will take a look at a few node deletion scenarios and what to do in each one.
Introduction
We are going to study how a node is deleted in a BST. In general, to delete a node in a BST, you will search for it and, once found, you’ll make it None by making the left or right child of its parent None. However, to make things simpler, we’ve identified six possible cases involved in BST node deletion. We’ll tackle each one separately. ...