Domanda di colloquio di Meta
Traverse a binary tree one level at a time.
Risposta di colloquio
Anonimo
27 set 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.
Anonimo
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