222. Count Complete Tree Nodes LeetCode
2016-03-16 18:24
549 查看
题意：求完全二叉树的节点数。
题解：先看看这课子树是不是满的，是满的返回2^h - 1个，否则递归求左右儿子的个数。
题解：先看看这课子树是不是满的，是满的返回2^h - 1个，否则递归求左右儿子的个数。
class Solution {
public:
int countNodes(TreeNode* root) {
if(root == NULL) return 0;
int l = 0,r = 0;
TreeNode *le = root->left;
TreeNode *ri = root->right;
while(le || ri)
{
if(le != NULL)
{
le = le->left;
l++;
}
if(ri != NULL)
{
ri = ri->right;
r++;
}
}
if(l == r) return (2 << l) - 1;
else return 1 + countNodes(root->left) + countNodes(root->right);
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解