Given a binary tree, traverse the tree and for every node, if the node's value is less than the sum of its children's values, update the node's value to be that sum. If a node has only one child, use…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.