I actually understood the method done in Euler Tour algorithm but don't understand why it works? Here is the pseudo.

dfs (v):
           for u in adj[v]:
               erase the edge v-u and dfs(u)
            push v at the end of e