A Software Engineering Space

Revisiting Deletion in a Binary Search Tree

Deleting Arbitrary Nodes in a Binary Search Tree For all of its meritsm the binary search tree data structure has one glaring fault: deleting an arbitrary node is somewhat complicated process. Insertion, searching, even rotations are all accomplished in a straight forward and rather intuitive manner. Unfortunately, removing a node must handle so many corner […]