Timeline for Is there a way to find path length to a node from root in a binary tree?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 1, 2015 at 12:57 | comment | added | Raphael | A bound in terms of the height of tree is more meaningful here. | |
| Mar 1, 2015 at 1:14 | comment | added | w00d | I think the op wants in terms of node, so it's just $O(n^2)$ | |
| Mar 1, 2015 at 0:33 | review | First posts | |||
| Mar 1, 2015 at 17:45 | |||||
| Mar 1, 2015 at 0:31 | history | answered | David Arch | CC BY-SA 3.0 |