Peng-Yu Chen

Hi @CurieLuo, thank you for issuing the problem. However, I'm busy recently. I'll try to correct this when I'm free.

I've added the `EULER-TOUR` pseudocode [here](https://walkccc.github.io/CLRS/Chap22/Problems/22-3/)

Yes, I agree with you. The problem asks us to eliminate recursion. To achieve the same time complexity, we have to use a variable to record who's the first WHITE...

Yea, please create a PR :)

For (b), I think you're right. Since $\Theta(\log_d n)$ is also correct, I'll leave it as it is for now. For (c), Updated the if-clause in the pseudocode. Thank you!

Hi @ustcjsj, Can you create a PR for this. Thanks!