percursos.java

package percursos;
public class Percursos {
	public void preOrdemRec(Node root) {
		if (root != null) {
			visit(root);
			preOrdemRec(root.getNoE());
			preOrdemRec(root.getNoD());
		}
	}
	public void posOrdem(Node root) {
		if (root != null) {
			posOrdem(root.getNoE());
			posOrdem(root.getNoD());
			visit(root);
		}
	}
	public void iterativePreOrdem(Node root) {
		Node no = root;
		Stack travStack = new NodeStack();
		if (no != null) {
			travStack.push(no);
			while (!travStack.isEmpty()) {
				no = (Node) travStack.pop();
				visit(no);
				if (no.getNoD() != null)
					travStack.push(no.getNoD());
				if (no.getNoE() != null)
					travStack.push(no.getNoE());
			}
		}
	}
	public void iterativePostorder(Node root) {
		Node p = root, q = root;
		Stack travStack = new NodeStack();
		while (p != null) {
			for (; p.getNoE() != null; p = p.getNoE())
				travStack.push(p);
			while (p != null && (p.getNoD() == null || p.getNoD() == q)) {
				visit(p);
				q = p;
				if (travStack.isEmpty())
					return;
				p = (Node) travStack.pop();
			}
			travStack.push(p);
			p = p.getNoD();
		}
	}
	private void visit(Node no) {
		System.out.print(no.getInfo() + " ");
	}
}