need help with post order traversal

[Metastar]

Hi, my problem with my post order traversal method of a binary tree is that it prints everything in the correct order just in decending order instead of ascending. Was wondering if anyone could see why. Thanks in advance.

private void postOrderItrLRN(Node localRoot)
    {
        Node current = localRoot;
        
        while(true)
        {
            if(current != null)
            {
                theStack.push(current);
                System.out.println(current.getCData());
                current = current.getRightChild();
            }
            else if(theStack.isEmpty())
                break;
            else
                current = theStack.pop().getLeftChild();
                
        }
    }

[m00nchile]

If you build a Binary Search Tree, the traversal that outputs the elements in ascending order is inorder, not postorder.

[Metastar]

I do understand that, I'm just trying to figure out why it's printing them that way and how I can get my method to print them in postorder. I still cannot figure this one out. My method as it stands now has a few errors, just seeing if someone can point them out and guide me in the right direction.

[m00nchile]

Hmm, glancing over your code, it seems to do the printout in preorder, since you print out the root, and then traverse the left and right subtrees. One tip, writing tree traversals recursively is much simpler. Write up a recursive version of post order traversal, study the results and then go back to your iterative version.