BFS. An algorithm that starts the search from the root node and moves from left to right along the hierarchy tree. The algorithm explores all nodes on one child level before proceeding to the next level. BFS uses the queue data structure to find the shortest path. Use this algorithm in a narrower hierarchy tree with many child levels.

DFS. An algorithm that starts the search from the root node and moves from top to bottom of the hierarchy tree. The algorithm explores each branch of the tree until it reaches the bottom node before proceeding onto the next branch. DFS uses the stack data structure to find the shortest path. Use this algorithm in a wider hierarchy tree with fewer child levels.