/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int getDepth(TreeNode* root){
if(!root)
return 0;
return max(getDepth(root->left),getDepth(root->right))+1;
}
int countNodes(TreeNode* root) {
if(!root)
return 0;
int leftH=getDepth(root->left);
int rightH=getDepth(root->right);
if(leftH>rightH){
return countNodes(root->left)+1+pow(2,rightH)-1;
}
else{
return countNodes(root->right)+1+pow(2,leftH)-1;
}
}
};
222. 完全二叉树的节点个数
最新推荐文章于 2024-10-16 10:13:45 发布