java数据结构（二叉树的遍历）

package link;

import java.util.Arrays;
import java.util.LinkedList;

/**
 * 二叉树
 * @author 欸嘿
 *
 */
public class Tree {
	/**
	 * 构建二叉树
	 * @param inputList 输入的序列
	 * @return
	 */
	public static TreeNode createBinatyTree(LinkedList<Integer> inputList) {
		TreeNode node =null;
		if(inputList==null||inputList.isEmpty()) {
			return null;
		}
		Integer data=inputList.removeFirst();
		if(data!=null) {
			node=new TreeNode(data);
			node.leftChild=createBinatyTree(inputList);
			node.rightChile=createBinatyTree(inputList);
		}
		return node;
	}
	/**
	 * 二叉树前序遍历
	 */
	public static void preOrderTraveral(TreeNode node) {
		if(node==null) {
			return ;
		}
		System.out.println(node.data);
		preOrderTraveral(node.leftChild);
		preOrderTraveral(node.rightChile);
	}
	/**
	 * 二叉树中序遍历
	 */
	public static void inOrderTraveral(TreeNode node) {
		if(node==null) {
			return ;
		}
		inOrderTraveral(node.leftChild);
		System.out.println(node.data);
		inOrderTraveral(node.rightChile);
	}
	/**
	 * 二叉树后序遍历
	 */
	public static void postOrderTraveral(TreeNode node) {
		if(node==null) {
			return ;
		}
		postOrderTraveral(node.leftChild);
		postOrderTraveral(node.rightChile);
		System.out.println(node.data);
	}
	
	/**
	 * 二叉树节点
	 */
	private static class TreeNode{
		int data;
		TreeNode leftChild;
		TreeNode rightChile;
		
		TreeNode(int data){
			this.data=data;
		}
	}
	public static void main(String[] args) {
		LinkedList<Integer> inputList=new LinkedList<Integer>(Arrays.asList(new Integer[] {3,2,9,null,null,10,null,null,8,null,4}));
		TreeNode treeNpde=createBinatyTree(inputList);
		System.out.println("前序遍历");
		preOrderTraveral(treeNpde);
		System.out.println("中序遍历");
		inOrderTraveral(treeNpde);
		System.out.println("后序遍历");
		postOrderTraveral(treeNpde);
		
	}
}