Given the root of a Binary Search Tree (BST) and two integers low and high representing a closed range [low, high], trim the tree so that all remaining nodes have keys in [low, high], maintaining the…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.