Leetcode 450. Delete Node in a BST

Delete the node with a given key from a BST while preserving BST order: search down O(height) to find the node and then handle the three cases (no child, one child, or two children — replace with inorder successor/predecessor) to return the updated root.