BFS is far from academic though, it&#x27;s a very common tree&#x2F;graph traversal algorithm when you want to traverse in-order, like propagation of events in a UI, or printing contents of a nested data structure for debugging purposes, or searching for the top-most element in a tree that meets your criteria so you can insert a new child subtree (very common operation in nested GUI). Hell, it&#x27;s not even such an alien concept for a web&#x2F;frontend developer...