对答案二分法进行求解
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int countNodes(TreeNode* root) {
TreeNode *p=root;
int n=0;
while(p) ++n,p=p->right;
int l=(1<<n)-1,r=(1<<(n+1))-2;
while(l<r){
int mid=(l+r+1)>>1;
p=root;
for(int k=n-1;k>=0;--k)
if(mid&(1<<k)) p=p->right;
else p=p->left;
if(p) l=mid;
else r=mid-1;
}
return l;
}
};