Domanda di colloquio di Google
Deep search binary tree, what is the worst case memory requirement using Queue.
Risposte di colloquio
Anonimo
21 gen 2012
If you meant BFS than it is O(V) if all the vertices are neighbours of the source. than all be added to the queue before the first pop.