Google Interview Question: Deep search binary tree, what is the worst case memory requirement using Queue.

Notifications

Google

Deep search binary tree, what is the worst case memory requirement using Queue.

Anonymous

Apr 22, 2012

This question is unclear, can you specify?

Anonymous

Jan 21, 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.