二叉树的镜像

二叉树的镜像

操作给定的二叉树，将其变换为源二叉树的镜像。

import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;

public class MirrorBinaryTree {

	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<ArrayList<Integer>> arrayList1 = Print(root);//调用把二叉树打印成多行方法
		System.out.println(arrayList1);
		
		Mirror(root);
		
		ArrayList<ArrayList<Integer>> arrayList2 = Print(root);//调用把二叉树打印成多行方法
		System.out.println(arrayList2);					
	}

	public static void Mirror(TreeNode root) {
		TreeNode temp;
		if (root != null) {
			temp = root.left;
			root.left = root.right;
			root.right = temp;
			if (root.left != null)
				Mirror(root.left);
			if (root.right != null)
				Mirror(root.right);
		}
	}

	// 重建二叉树
	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<ArrayList<Integer>> Print(TreeNode pRoot) {
       ArrayList<ArrayList<Integer>> layers = new ArrayList<ArrayList<Integer>>();
      if (pRoot == null)
          return layers;
      Deque<TreeNode> queue = new LinkedList<TreeNode>();
      
      queue.offer(pRoot);
      
      while (!queue.isEmpty()) {
          ArrayList<Integer> layer = new ArrayList<Integer>();
          int cur = 0, size = queue.size();
          while (cur < size) {
              TreeNode node = queue.poll();
              layer.add(node.val);
              if (node.left != null) {
                  queue.offer(node.left);
              }
              if (node.right != null) {
                  queue.offer(node.right);
              }
              cur ++;
          }
          layers.add(layer);
      }
      return layers;
  }	
}

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]]
// [[1], [3, 2], [6, 5, 4], [8, 7]]