Count Complete Tree Nodes
来源:互联网 发布:淘宝卖家找货源网 编辑:程序博客网 时间:2024/05/14 03:29
class Solution {
public:
int countNodes(TreeNode* root) {
if(root==NULL) return 0;
int left=0,right=0;
TreeNode* l=root, *r=root;
while(l) {left++;l=l->left;} //如果局部有满二叉树,则直接返回个数;
while(r) {right++;r=r->right;}
if(left==right) return pow(2,left)-1;
return 1+countNodes(root->left)+countNodes(root->right);
}
};
public:
int countNodes(TreeNode* root) {
if(root==NULL) return 0;
int left=0,right=0;
TreeNode* l=root, *r=root;
while(l) {left++;l=l->left;} //如果局部有满二叉树,则直接返回个数;
while(r) {right++;r=r->right;}
if(left==right) return pow(2,left)-1;
return 1+countNodes(root->left)+countNodes(root->right);
}
};
0 0
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes(****)
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- Count Complete Tree Nodes
- 华硕B85M-G主板安装心得
- Boundaries
- 【c程序】关于宏
- iOS: ARC和非ARC下使用Block属性的问题
- C#软件winform程序安装包制作
- Count Complete Tree Nodes
- CSS 选择器
- 软工视频总结(前半部分)
- Linux网络栈剖析—从socket到设备驱动程序
- CodeForces 413E Maze 2D
- 机房收费问题总结(二)
- javascript 1
- 用EJB进行事务管理
- 30 语句