Answer: Depth-first search (DFS) is an algorithm for traversing or searching
tree or graph data structures. One starts at the root (selecting some arbitrary
node as the root in the case of a graph) and explores as far as possible along
each branch before backtracking.
Post a Comment