Back
Trees
Question 1 of 10
10% Complete
Hard
Binary Tree Maximum Path Sum is solved with...
A
Inorder traversal and prefix sums
B
BFS with a queue only
C
Postorder DFS returning max gain per node
D
Sorting node values