Which of the following statements about iterative deepening is NOT true?
a. It requires more computation time to search the tree than a breadth-first search algorithm
b. It is a breadth-first search algorithm
c. It is a depth-first search algorithm
d. It requires more memory to store the visited nodes than a breadth-first search algorithm



Answer :

Other Questions