Let’s look at the binary tree, a data structure that looks something like this:
Usually, to traverse it, that is, visit its every node, we use recursion. But there is another method called depth traverse. Using some specific data structure we can use it instead of recursion.
What structure might it be? Use external resources to find the answer.