Given the root node of a Binary Search Tree (BST) and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.