C in 100 Seconds: Binary Search Tree | Episode 52

Search a BST by going left or right at each node. Delete handles three cases — leaf, one child, two children. The hardest case replaces the node with its inorder successor.