Q70
Which of the following can traverse the state space tree only in DFS manner?
A.
branch and bound
B.
dynamic programming
C.
greedy algorithm
D.
backtracking
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board