从上往下打印二叉树

从上往下打印二叉树

从上往下打印出二叉树的每个节点，同层节点从左至右打印。

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;

public class PrintingBinaryTree {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] pre = { 1, 2, 4, 7, 3, 5, 6, 8 };// 前序遍历序列
		int[] in = { 4, 7, 2, 1, 5, 3, 8, 6 };// 中序遍历序列
		TreeNode root = reConstructBinaryTree(pre, in);// 调用重建二叉树方法 ;
		
		ArrayList<Integer> arrayList = PrintFromTopToBottom(root);
		System.out.println(arrayList);
	}
	
	// 重建二叉树
	public static TreeNode reConstructBinaryTree(int[] pre, int[] in) {
		if (pre == null || in == null) {
			return null;
		}

		java.util.HashMap<Integer, Integer> map = new java.util.HashMap<Integer, Integer>();
		for (int i = 0; i < in.length; i++) {
			map.put(in[i], i);
		}
		return preIn(pre, 0, pre.length - 1, in, 0, in.length - 1, map);
	}

	public static TreeNode preIn(int[] p, int pi, int pj, int[] n, int ni, int nj,
			java.util.HashMap<Integer, Integer> map) {
		if (pi > pj) {
			return null;
		}
		TreeNode head = new TreeNode(p[pi]);
		int index = map.get(p[pi]);
		head.left = preIn(p, pi + 1, pi + index - ni, n, ni, index - 1, map);
		head.right = preIn(p, pi + index - ni + 1, pj, n, index + 1, nj, map);
		return head;
	}
	
	//从上往下打印二叉树
	public static ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
		ArrayList<Integer> arrayList = new ArrayList<Integer>();
		if (root == null) {
			return arrayList;
		}
		Queue<TreeNode> queue = new LinkedList<TreeNode>();
		queue.add(root);
		while (!queue.isEmpty()) {
			TreeNode node = queue.poll();
			arrayList.add(node.val);
			if (node.left != null) {
				queue.add(node.left);
			}
			if (node.right != null) {
				queue.add(node.right);
			}
		}
		return arrayList;
	}	
}

public class TreeNode {
	
		int val = 0;
		TreeNode left = null;// 左节点
		TreeNode right = null;// 右节点

		public TreeNode(int val) {
			this.val = val;
		}
	
}

//输出：[1, 2, 3, 4, 5, 6, 7, 8]