# Introduction Tree traversal is a common operation in computer science and is used to visit each node in a tree exactly once. Depth-first search (DFS) is a popular algorithm for traversing trees and graphs. In this challenge, we will implement DFS on a binary tree.
Click the virtual machine below to start practicing