java对二叉树的前序、中序、后序遍历

一、前序遍历

访问顺序：先根节点，再左子树，最后右子树

二、中序遍历

访问顺序：先左子树，再根节点，最后右子树；
　　
三、后序遍历

访问顺序：先左子树，再右子树，最后根节点

构成二叉树的图片如下

四、构建一个节点类，并实现遍历方法

class HeroNode{
	private int no;
	private String name;
	private HeroNode left;
	private HeroNode right;
	public int getNo() {
		return no;
	}
	public void setNo(int no) {
		this.no = no;
	}
	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 HeroNode(int no, String name) {
		this.no = no;
		this.name = name;
	}
	@Override
	public String toString() {
		return "HeroNode [no=" + no + ", name=" + name + "]";
	}
	
	//编写前序遍历的方法
	public void preOrder() {
		System.out.println(this);
		//递归向左之树前序遍历
		if(this.left!=null) {
			this.left.preOrder();
		}
		//递归向右子树前序遍历
		if(this.right!=null) {
			this.right.preOrder();
		}
	}
	
	//中序遍历
	public void infixOrder() {
		//递归向左之树中序遍历
		if(this.left!=null) {
			this.left.infixOrder();
		}
		System.out.println(this);
		if(this.right!=null) {
			this.right.infixOrder();
		}
	}
	//后序遍历
	public void postOrder() {
		if(this.left!=null) {
			this.left.postOrder();
		}
		if(this.right!=null) {
			this.right.postOrder();
		}
		System.out.println(this);
	}
}

5、构成一棵树

class BinaryTree{
	private HeroNode root;

	public void setRoot(HeroNode root) {
		this.root = root;
	}
	
	public void preOrder() {
		if(this.root!=null) {
			this.root.preOrder();
		}else {
			System.out.println("为空");
		}
	}
	
	public void infixOrder() {
		if(this.root!=null) {
			this.root.infixOrder();
		}else {
			System.out.println("为空");
		}
	}
	
	public void postOrder() {
		if(this.root!=null) {
			this.root.postOrder();
		}else {
			System.out.println("为空");
		}
	}
}

6、测试代码

public void se() {
			BinaryTree binaryTree=new BinaryTree();
			HeroNode root=new HeroNode(1,"1");
			HeroNode node2=new HeroNode(2,"2");
			HeroNode node3=new HeroNode(3,"3");
			HeroNode node4=new HeroNode(4,"4");
			HeroNode node5=new HeroNode(5,"5");
			//把节点组装成一个二叉树
			root.setLeft(node2);
			root.setRight(node3);
			node3.setRight(node4);
			node3.setLeft(node5);
			binaryTree.setRoot(root);
			System.out.println("前序遍历");
			binaryTree.preOrder();
			
			System.out.println("中序遍历");
			binaryTree.infixOrder();
			
			System.out.println("后序遍历");
			binaryTree.postOrder();
		}

5、结果如下

前序遍历
HeroNode [no=1, name=1]
HeroNode [no=2, name=2]
HeroNode [no=3, name=3]
HeroNode [no=5, name=5]
HeroNode [no=4, name=4]
中序遍历
HeroNode [no=2, name=2]
HeroNode [no=1, name=1]
HeroNode [no=5, name=5]
HeroNode [no=3, name=3]
HeroNode [no=4, name=4]
后序遍历
HeroNode [no=2, name=2]
HeroNode [no=5, name=5]
HeroNode [no=4, name=4]
HeroNode [no=3, name=3]
HeroNode [no=1, name=1]