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!

Categories

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();
}
}

Tagged:
Sign In or Register to comment.