Hierarchical node traversal via recursion DFS or level-order queue BFS
2 standard techniques
answer(node) = f(node, left, right).
Queue processes one level at a time.