title: Greedy Best First Search and Depth First Search
body: <p>Is it possible for Greedy Best First Search to behave like Depth First Search in any case? </p>
  
  <p>I see that worst case of both of these algorithms is similar O(b^m). Does this mean that they behave in same way? </p>