MediumCoding

Find the sum of all elements in a binary tree that fall within the range [low, high], where 'low' and 'high' are integers.

Asked at

Meta

1Give yourself 5 minutes

2Answer out loud, not in your head

3Then compare with the answer below

Reference answer

A recursive approach is ideal for this problem. Traverse the binary tree, and for each node, check if its value is within the [low, high] range. If it is, add its value to the running sum. Continue the traversal for both left and right children, but optimize by pruning branches: if a node's value is less than low, only traverse its right subtree; if its value is greater than high, only traverse its left subtree.

Free to read · better with Enzo

Practice this out loud with Enzo

Enzo runs it as a mock interview, pushes back with follow-ups, and grades you on the rubric.

Continue with Enzo Sign up free

Next question

Calculate the trapped rainwater between bars in a given array.
Find a triplet in an array with a given sum.
Print all combinations of numbers from 1 to n that sum to n.
Find the number of rotations in a circularly sorted array.
Find all permutations of a given string.
Check if two given binary trees are identical.