二叉樹的深度

二叉樹深度

/**
 * Definition for a binary tree node. 
 * public class TreeNode { 
 * 	int val; 
 *  TreeNode left; 
 *  TreeNode right; 
 *  TreeNode(int x) { 
 *  val = x; 
 *  } 
 * }
 */

public class D20161008N104MaximumDepthofBinaryTree {
	public int maxDepth(TreeNode root) {
		if(root == null){
			return 0;
		}
		else{
			int left = maxDepth(root.left);
			int right = maxDepth(root.right);
			return 1 + Math.max(left, right);
		}
	}

}