S3:E3 - "Making brownies with depth-first search"

How are algorithms related to brownies? And how do we navigate through the nodes of a tree when implementing depth-first search?