C++ (Cpp) getRightDepth示例

示例#1

文件： 222_Count_Complete_Tree_Nodes.cpp 项目： heshenghuan/leetcode-exercise

 int countNodes(TreeNode* root) {
     if(!root) return 0;
     
     int l = getLeftDepth(root);
     int r = getRightDepth(root);
     
     if(l == r) return (2<<(l-1)) - 1;
     
     return countNodes(root->left) + countNodes(root->right) + 1;
 }

示例#2

文件： 222.cpp 项目： HaochenLiu/My-LeetCode-CPP

 int countNodes(TreeNode* root) {
     if(root == NULL) return 0;
     if(root->left == NULL && root->right == NULL) return 1;
     int l = getLeftDepth(root);
     int r = getRightDepth(root);
     if(l == r) {
         return (1<<l) - 1;
     } else {
         return 1 + countNodes(root->left) + countNodes(root->right);
     }
 }