Timeline for Printing a Binary Tree top-down (column wise)
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/
|
|
| Jul 14, 2015 at 18:42 | history | edited | rolfl | CC BY-SA 3.0 |
credit before deletion
|
| Jul 14, 2015 at 2:03 | history | edited | rolfl | CC BY-SA 3.0 |
Improved the answer based on Fihop feedback.
|
| S Mar 28, 2015 at 2:22 | history | edited | Brythan | CC BY-SA 3.0 |
fixed previous edit
|
| S Mar 28, 2015 at 2:22 | history | suggested | seeker | CC BY-SA 3.0 |
fixed previous edit
|
| Mar 28, 2015 at 2:09 | review | Suggested edits | |||
| S Mar 28, 2015 at 2:22 | |||||
| S Mar 28, 2015 at 0:33 | history | suggested | seeker | CC BY-SA 3.0 |
corrected details
|
| Mar 28, 2015 at 0:25 | review | Suggested edits | |||
| S Mar 28, 2015 at 0:33 | |||||
| S Mar 27, 2015 at 23:41 | history | suggested | CommunityBot | CC BY-SA 3.0 |
minor correction
|
| Mar 27, 2015 at 23:17 | review | Suggested edits | |||
| S Mar 27, 2015 at 23:41 | |||||
| Dec 7, 2013 at 14:14 | vote | accept | Rohit Jain | ||
| S Dec 6, 2013 at 19:09 | history | suggested | Rohit Jain | CC BY-SA 3.0 |
Replaced `List<Node<T>>` with `List<Node<Integer>>` from the last for loop.
|
| Dec 6, 2013 at 19:01 | review | Suggested edits | |||
| S Dec 6, 2013 at 19:09 | |||||
| Dec 6, 2013 at 18:59 | comment | added | Rohit Jain | I was trying the iterative approach, because most of the time, interviewer ask for that explicitly, in cases where they know recursive approach is too easy to ask for, like in this case. | |
| Dec 6, 2013 at 18:57 | comment | added | Rohit Jain |
Updated the question. I hope that it is more clear now. For queue part, I guess I've overlooked the fact that I could have used preorder, postorder or inorder traversal. That wouldn't have made any difference. So, yes queue can be avoided here. BTW, thanks for your solution. I was completely ignoring the possible recursive solution. It looks so simple with that. Nice :)
|
|
| Dec 6, 2013 at 18:46 | history | answered | rolfl | CC BY-SA 3.0 |