Deletion in Binary Search Tree
Explore the deletion process in binary search trees by understanding how to handle nodes with no children, one child, and two children. This lesson guides you through each deletion scenario, helping you manage tree structure efficiently in C#.
Introduction
In this lesson, you 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. Once it is found, you’ll free the space taken by that node, and you will re-allocate its left and right-subtree (if present). To make things simpler, we’ve identified four possible cases involved in BST node deletion. You will tackle each one separately:
- Deleting in an empty tree