再见小小ronnie的博客

For Eulerian graph, every edge is visited exactly once. Eulerian graph, the number of odd degree edge is either 0 or 2. Eulerian circuit, all vertex's degree are even.   Algorithm for finding a Eul

Tail recursive will return the result immediately when the recursion reach the base case. However, for normal recursion, when it reaches the base case it will return to the previous call again and a