Algorithm for post order traversal of a binary tree - Programmers Heaven

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.

Algorithm for post order traversal of a binary tree

pylertpylert Posts: 0Member

Below is my algorithm for a post order traversal of a binary tree. Is there a bug/mistake/error in this algorithm that needs fixing?

public T next(){ position = someStack.pop(); if(position.hasLeftNode()){ position = position.getLeftNode(); next();//recursive call position.getInfo();} someStack.push(position); if(position.hasRightNode()){ position = position.getRightNode(); next();retrun position.getInfo();} someStack.push(position); return someStack.pop().getInfo(); } }

Sign In or Register to comment.