Meta interview question
Traverse a binary tree one level at a time.
Interview Answer
Anonymous
Sep 27, 2012
For breadth first, add all children to the queue, then pull the head and do a breadth first search on it, using the same queue
Traverse a binary tree one level at a time.
Anonymous
For breadth first, add all children to the queue, then pull the head and do a breadth first search on it, using the same queue
Check out your Company Bowl for anonymous work chats.