title: Difference between 'backtracking' and 'branch and bound'
body: <p>In backtracking we use both bfs and dfs. Even in branch and bound we use both bfs and dfs in additional to least cost search.</p>
  
  <p>so when do we use backtracking and when do we use branch and bound</p>
  
  <p>Does using branch and bound decreases time complexity?</p>
  
  <p>What is Least cost search in Branch and Bound?</p>