Delete Node in a BST

Delete the node with a given key from a BST (if present). When the node has two children replace it with its inorder successor. Print the resulting tree in level-order.

0 <= number of nodes <= 10^4 All values are unique