Deletion in Binary Search Tree (Implementation)
Explore how to implement deletion in binary search trees using JavaScript. Understand different cases including deleting empty trees, leaf nodes, nodes with one child, and nodes with two children, enabling you to handle BST modifications effectively.
Introduction #
Let’s implement the delete function for BSTs. We’ll build upon the code as we cater to each case.
1. Deleting an Empty Tree #
Let’s start with a skeleton function definition and cater to the first case. We return false if the root node is null.
In our current implementation of JavaScript, we always initialize an object of the ...