递归,当该节点为空时返回0;不为空时则左右子树的最大深度+1.
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int depth(TreeNode node){
if(node!=null){
return 1+Math.max(depth(node.left),depth(node.right));
}
else{
return 0;
}
}
public int maxDepth(TreeNode root) {
if(root==null){
return 0;
}
int d=depth(root);
return d;
}
}