Multiple choice The Depth-First Search uses substitution recursion non-recursion none of the above Reveal answer Fill a bubble to check yourself B Correct answer Explanation Depth-First Search (DFS) is a classic algorithm that traverses tree or graph structures by going as deep as possible before backtracking, which is naturally implemented using recursion.