title: What is the difference between breadth first searching and level order traversal?
body: <p>I don't need code, just an explanation. My textbook says</p>
  
  <blockquote>
    <p>level order: each node at level i is processed before any node at level i+1</p>
  </blockquote>
  
  <p>My understanding of breadth first searching is that you explore nodes nearest the root first, starting from the left? How is this any different? Is this a square and rectangle sort of situation?</p>