二叉树的深度

二叉树的深度

输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。

public class BinaryTreeDepth {

	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);// 调用重建二叉树方法 ;
		
		int depth = TreeDepth(root);//查看二叉树的深度
		System.out.println(depth);
		
	}

	// 重建二叉树
	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 int TreeDepth(TreeNode root) {
		if (root == null) {
			return 0;
		}

		int nLelt = TreeDepth(root.left);
		int nRight = TreeDepth(root.right);

		return nLelt > nRight ? (nLelt + 1) : (nRight + 1);
	}
	
}

public class TreeNode {

    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

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