Recursion and Trees
80 / 170Recursion and TreesLesson 13 of 13About 50 min
Two problems rebuilt cold, plus the three questions that decide the shape of any tree solution.
Find the largest sum of any root-to-leaf path in a binary tree whose values may be negative. What shape does the solution take?
You have solved this one before. Rebuild it from scratch without looking at your old submission. If the approach does not come back within a few minutes, that is the signal that it needs another pass.
You have solved this one before. Rebuild it from scratch without looking at your old submission. If the approach does not come back within a few minutes, that is the signal that it needs another pass.