treenode1.java

java实现数据结构-树的遍历,详情请看doc说明文件!

public class TreeNode1 { //二叉树的结点类 
	public String data; //数据元数 
	public TreeNode1 left,right; //指向左,右孩子结点的链 

	public TreeNode1(){ 
		this("?"); 
	} 

	public TreeNode1(String d){ //构造有值结点 
		data = d; 
		left = right = null; 
	} 

	public void preorder(TreeNode1 p){ //先根次序遍历二叉树 
		if(p!=null){ 
			System.out.print(p.data+" "); 
			preorder(p.left); 
			preorder(p.right); 
		} 
	} 

	public void inorder(TreeNode1 p){ //中根次序遍历二叉树 
		if(p!=null){ 
			inorder(p.left); 
			System.out.print(p.data+" "); 
			inorder(p.right); 
		} 
	} 

	public void postorder(TreeNode1 p){ //后根次序遍历二叉树 
		if(p!=null){ 
			postorder(p.left); 
			postorder(p.right); 
			System.out.print(p.data+" "); 
		} 
	} 
}