LeetCode 222. 完全二叉树的节点个数

/**
 * 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 countLevel(TreeNode* root){ //完全二叉树求深度只需要遍历左子树的深度
        int level = 0;
        while(root){
            root = root->left;
            ++level;
        }
        return level;
    }

    int countNodes(TreeNode* root) {
        if(!root){
            return 0;
        }
        int left_level = countLevel(root->left);    //左子树的深度
        int right_level = countLevel(root->right);  //右子树的深度
        if(left_level == right_level){
            return countNodes(root->right) + pow(2, left_level);    //左子树深度等于右子树，即左子树为满二叉树
        }else{
            return countNodes(root->left) + pow(2, right_level);    //左子树深度大于右子树，即右子树为满二叉树
        }
    }
};