Question

Both LIFO branch and bound strategy and backtracking leads to depth first search.

(a) true

(b) false

This question was addressed to me in my homework.

I would like to ask this question from Graph Search in chapter Graph Search of Data Structures & Algorithms II

Answer 1

The correct option is (a) true

Best explanation: Both backtrackings as well as branch and bound are problem solving algorithms. Both LIFO branch and bound strategy and backtracking leads to depth first search.