Post-order Traversal Algorithm | Tree Traversal | Visualization, Code, Example

[@ishamaru9777]

This explanation was clear and precise.

[@mukulsharma1666]

Probably the best explaination ever! Thanks

[@srishtijha3]

This is so useful. The stack concept brought so much clarification

[@akhilhimnad9281]

Very Good explaination. For the first time i got clarity about the sequence of traversal . Thank you Sir !!

[@chuudayo]

this is the exact video i was looking for, thanks for this great explanation

[@dreamphoenix]

Excellent explanation. Thank you.

[@akhilhimnad9281]

You are in which college?

[@ywreck]

Great work this is very useful

[@wesleychou8148]

this is a wonderful video!

[@spencersedano]

How does it know to not keep going to the left? 2:10

[@notnotducminh]

if you haven't found out the answer, it's because it has just called postorder on its left node (1), and when (1) finishes, (2) moves on to the next line

[@Chandan-zi9ml]

🛐🛐🛐🛐🛐🛐🛐🛐🛐🛐