Timeline for Given a binary tree, \$T\$ whose nodes have positive values, find the value of the maximal path
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 1, 2017 at 0:43 | vote | accept | josfervi | ||
| Mar 28, 2017 at 19:09 | comment | added | Graipher |
Maybe right_max_depth and right_max_path?
|
|
| Mar 28, 2017 at 19:06 | comment | added | Graipher |
I would suggest using right_max and left_max for max_path_in_right_subtree and max_path_in_left_subtree. Can't think of anything good for max_path_from_a_leaf_up_to_root, though.
|
|
| Mar 28, 2017 at 18:28 | history | edited | alecxe | CC BY-SA 3.0 |
added 1680 characters in body
|
| Mar 28, 2017 at 18:22 | history | answered | alecxe | CC BY-SA 3.0 |