Given the root of a Binary Search Tree and a range [min, max], trim the tree such that all the elements in the new tree lie within the range [min, max]. The modified tree must retain the BST property.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.