Deletion in binary search tree

Question

So when I delete in binary search tree, do I need to have like 7 different cases i.e.

1. Left Leaf;
2. Right Leaf;
3. Left child with only left child.

Answer 1

Deleting a NULL pointer has no ill effect. So, you should be able to do this with no special cases. The basic part is just:

delete current->left;
delete current->right;