Timeline for Calculate the path sum of a binary tree
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2016 at 5:01 | vote | accept | Lin Ma | ||
| Jul 8, 2016 at 2:05 | comment | added | zondo | @LinMa: Your algorithm looks good; I don't really see much that could be improved. I did edit my answer to add a tiny bit, however. | |
| Jul 8, 2016 at 2:05 | history | edited | zondo | CC BY-SA 3.0 | added 421 characters in body |
| Jul 8, 2016 at 1:59 | comment | added | Lin Ma | Thanks zondo, nice comments and vote up. To address my original question, is the code logic correct in my code and whether you think there are rooms for improvement from performance (time complexity perspective)? | |
| Jul 8, 2016 at 1:07 | history | answered | zondo | CC BY-SA 3.0 |