Given the root of an unbalanced Binary Search Tree (BST), reconstruct it into a height-balanced BST. A height-balanced BST is defined as a binary tree where the depth of the two subtrees of every node…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.