二叉树前中后序遍历

package tree;

public class BinaryTreeAPP {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根
		HeroNode root=new HeroNode(1, "宋江");
		HeroNode node1=new HeroNode(2, "吴用");
		HeroNode node2=new HeroNode(3, "卢俊义");
		HeroNode node3=new HeroNode(4, "林冲");
		HeroNode node4=new HeroNode(5, "关胜");
		root.setLeft(node1);
		root.setRight(node2);
		node2.setRight(node3);
		node2.setLeft(node4);
		BinaryTree binaryTree=new BinaryTree(root);
		System.out.println("前序排序");
		binaryTree.preOrder();
		System.out.println("中序排序");
		binaryTree.midOrder();
		System.out.println("后序排序");
		binaryTree.postOrder();
	}

}

//树
class BinaryTree{
	private HeroNode root;
	public BinaryTree(HeroNode root) {
		this.root=root;
	}
	
	//调用前序遍历
	public void preOrder() {
		if(root!=null) {
			root.preOrder();
		}else {
			System.out.println("根节点为空 ");
		}
	}
	
	//调用中序遍历
	public void midOrder() {
		if(root!=null) {
			root.midOrder();
		}else {
			System.out.println("根节点为空 ");
		}
	}
	
	//调用后序遍历
	public void postOrder() {
		if(root!=null) {
			root.postOrder();
		}else {
			System.out.println("根节点为空 ");
		}
	}
}

//结点
//回溯遍历
class HeroNode{
	private int no;
	private String name;
	private HeroNode left;
	private HeroNode right;
	public HeroNode(int no,String name) {
		this.setNo(no);
		this.setName(name);
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public HeroNode getLeft() {
		return left;
	}
	public void setLeft(HeroNode left) {
		this.left = left;
	}
	public HeroNode getRight() {
		return right;
	}
	public void setRight(HeroNode right) {
		this.right = right;
	}
	public int getNo() {
		return no;
	}
	public void setNo(int no) {
		this.no = no;
	}
	public void show() {
		System.out.println("HeroNode [no="+no+",name="+name+"]");
	}
	
	//前序遍历
	public void preOrder() {
		this.show();
		if(this.left!=null) {
			this.left.preOrder();
		}
		if(this.right!=null) {
			this.right.preOrder();
		}
	}
	
	//中序遍历
	public void midOrder() {
		if(this.left!=null) {
			this.left.midOrder();
		}
		this.show();
		if(this.right!=null) {
			this.right.midOrder();
		}
	}
	
	//后序遍历
	public void postOrder() {
		if(this.left!=null) {
			this.left.postOrder();
		}
		if(this.right!=null) {
			this.right.postOrder();
		}
		this.show();
	}
}

二叉树

运行结果