Topological Sort - Alien Dictionary (Infer Character Order)
Consider two approaches to solve the Alien Dictionary problem: (1) DFS postorder topological sort with recursion and (2) BFS Kahn's algorithm using a queue. When is the DFS approach preferable over BFS?
