My problem is: Let's start DFS on node number $1$. How many different DFS tree exist?
From my point of view I should count number of possible adjency lists. For example, for node number $1$ we have to possible adjency lists: $[2, 3]; [3, 2]$.
Is my approach ok ? What's your opinion ?