is there a way to write a stack-base implementation of postorder traversal of a binary tree without using recursion?<br>
<br>
how do I save the right subtree and the root at the same time while the left subtree is visited?
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.