Timeline for Printing a tree level by level
Current License: CC BY-SA 4.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 7, 2018 at 5:20 | history | edited | janos | CC BY-SA 4.0 |
deleted 29 characters in body
|
Feb 21, 2015 at 10:20 | comment | added | Aneesh K |
Wow. Thanks a lot. I was thinking List of Lists approach but couldn't figure out the part of the "consume all nodes in queue" approach. I'm really sorry about the comment "add root the list", I was working on a different implementation and forgot to remove it when I wrote traverseLevels .
|
|
Feb 21, 2015 at 10:17 | vote | accept | Aneesh K | ||
Feb 21, 2015 at 10:04 | history | edited | janos | CC BY-SA 3.0 |
added 1239 characters in body
|
Feb 21, 2015 at 9:52 | history | edited | janos | CC BY-SA 3.0 |
added 1239 characters in body
|
Feb 21, 2015 at 9:46 | history | answered | janos | CC BY-SA 3.0 |