Alexander Kazanski
Posted on
BFS with a queue is the cleanest way to visit a tree level by level. Great for 'return nodes at depth k' problems — here's the template.
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)