Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

PostOrder traversal of a binary tree.

pylertpylert Posts: 0Member
edited April 16 in Java

What's the algorithm for a PostOrder traversal of a binary tree? This doesn't seem to be working.

public class POIterator implements Iterator{ private final Deque<BNode> someStack; BNode position; public POIterator(BNoderoot){ someStack = new LinkedList<BNode>(); someStack.push(root); }

public boolean hasNext(){return !someStack.isEmpty();}

public T next(){ position = someStack.pop(); if(position.hasLeftChild()){ someStack.push(position.getLeftNode()); next();} if(position.hasRightNode()){ someStack.push(position.getRightNode()); next();} return position.getData(); } }

Is there something missing from my code. An error/bug perhaps?

Sign In or Register to comment.