class Solution {
public int maxDepth(TreeNode root) {
//递归法
if(root==null){
return 0;
}
int left=maxDepth(root.left);
int right=maxDepth(root.right);
int len=Math.max(left, right)+1;
return len;
}
}
class Solution {
public int countNodes(TreeNode root) {
if(root==null){
return 0;
}
int cntleft=countNodes(root.left);
int cntright=countNodes(root.right);
return cntleft+cntright+1;
}
}