题目描述
求给定二叉树的最大深度,
最大深度是指树的根结点到最远叶子结点的最长路径上结点的数量。
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public class MaxDepthMe {
private int maxLength = 0;
public static void main(String[] args) {
}
/**
* @param root TreeNode类
* @return int整型
*/
public int maxDepth (TreeNode root) {
maxDepth(root,0);
return maxLength;
}
public void maxDepth (TreeNode root, int length) {
if(root == null ){
if(length > maxLength){
maxLength = length;
}
return;
}
maxDepth(root.left, length+1);
maxDepth(root.right, length+1);
}
}