β
Correct Answer: (A)
depth-first search
Explanation: 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.
Explanation by: Mr. Dubey
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
Question Analytics
516
Total Visits
3 y ago
Published
Mr. Dubey
Publisher
87%
Success Rate