need help with post order traversal
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;
if(current != null)
current = current.getRightChild();
current = theStack.pop().getLeftChild();