> Invert the binary tree it's the tricky one.

This is too easy for everyone in this thread. Try this:

Mathematically prove that the time complexity of the DFS algorithm is O(V+E).