Depth-first search (DFS) is an algorithm used for traversing or searching through tree or graph data structures. The algorithm starts at a selected node (often referred to as the "root" in trees) and explores as far as possible along each branch before backtracking. This method allows DFS to explore deep into a structure before returning to explore other nodes.
