class Solution {
public:
int getDepth(TreeNode* node)
{
if(node==NULL)
return 0;
int left=getDepth(node->left);
int right=getDepth(node->right);
int maxnum=max(left,right);
maxnum++;
return maxnum;
}
int maxDepth(TreeNode* root) {
return getDepth(root);
}
};
class Solution {
public:
int getDepth(TreeNode* node)
{
//if(node==NULL)
//return 0;
//return min(1+getDepth(node->left),1+getDepth(node->right));
if(node==NULL)
return 0;
if(node->left!=NULL&&node->right==NULL)return 1+getDepth(node->left);
if(node->left==NULL&&node->right!=NULL)return 1+getDepth(node->right);
return min(1+getDepth(node->left),1+getDepth(node->right));
}
int minDepth(TreeNode* root) {
return getDepth(root);
}
};
222. 完全二叉树的节点个数 - 力扣(Leetcode)
class Solution {
public:
int countNodes(TreeNode* root) {
if(!root)return 0;
return 1+countNodes(root->left)+countNodes(root->right);
}
};