Bloomberg Interview Question
Traverse a balanced binary tree and find the greatest sum from one path.
Interview Answer
Anonymous
Nov 29, 2016
Recursion, go from the top to the bottom then work your way back up.
1
Traverse a balanced binary tree and find the greatest sum from one path.
Anonymous
Recursion, go from the top to the bottom then work your way back up.
Check out your Company Bowl for anonymous work chats.