Timeline for Printing a Binary Tree top-down (column wise)
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14, 2015 at 9:31 | comment | added | Jayesh | nicely explained with program:javabypatel.blogspot.in/2015/10/… | |
| Dec 7, 2013 at 14:14 | vote | accept | Rohit Jain | ||
| Dec 7, 2013 at 7:34 | comment | added | Rohit Jain | @200_success I know that doesn't make sense. Don't think it like printing the left childs first, and then the right child. Think of it a vertical traversal of tree. I've given the example that was asked in an interview (I didn't attend that interview though). | |
| Dec 6, 2013 at 21:03 | comment | added | 200_success | The challenge seems ill formed. What if "7" has two complete levels under it? I think you would probably consider the left child of "7" to share the same column as "5". What about the leftmost grandchild of "7"? Would it be to the left of "5"? That doesn't make sense. | |
| Dec 6, 2013 at 19:22 | history | tweeted | twitter.com/#!/StackCodeReview/status/409040144420073472 | ||
| Dec 6, 2013 at 18:56 | history | edited | Rohit Jain | CC BY-SA 3.0 |
added 681 characters in body
|
| Dec 6, 2013 at 18:46 | answer | added | rolfl | timeline score: 6 | |
| Dec 6, 2013 at 18:35 | history | edited | Rohit Jain |
edited tags
|
|
| Dec 6, 2013 at 18:06 | history | asked | Rohit Jain | CC BY-SA 3.0 |