Frage im Vorstellungsgespräch bei Google
Deep search binary tree, what is the worst case memory requirement using Queue.
Antworten zu Vorstellungsgespräch
Anonym
21. Jän. 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.