Skip to content

Latest commit

 

History

History
18 lines (14 loc) · 509 Bytes

File metadata and controls

18 lines (14 loc) · 509 Bytes

Breadth First Search

##Problem Domain search each level of a tree and return what looking for

##Solution

  • Put the root into a queue than put its left and right in and so on and so forth.
  • check the first node in the queue for the value being searched for dequeue if not the number and continue the process

Approach & Efficiency

Recursive approach O(n) space O(n) time ##Whiteboard pics:

Return to all README's