GeeksforGeeks » Interview Questions
Binary tree of integer is given find a path in tree that's maximum
(1 post)-
1) Path can be from root to leaf
2) Path can be from root to non leaf nodes
3) Path can be from non root node to leave node
4) path can be from non root node to non leaf node
5) one single node can also be a candidate6) no need to consider the path like this
Max Sum path in Left tree + Max Sum path in Left tree + current Node
where current node can be any node in the tree...Looking for time complexity space complexity
Reply
You must log in to post.
