1.

Which search method takes less memory?(a) Depth-First Search(b) Breadth-First search(c) Linear Search(d) Optimal search

Answer» The correct answer is (a) Depth-First Search

To explain I would say: Depth-First Search takes less memory since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has generated must be stored.


Discussion

No Comment Found

Related InterviewSolutions