CS Puzzle: Say you do a DFS on an nxn grid, starting from the top-left cell. Depending on the order in which you visit neighbors, you may create many different DFS trees. Of all of them, which one has the minimum height?