脚本宝典收集整理的这篇文章主要介绍了[LeetCode] 222. Count Complete Tree Nodes，脚本宝典觉得挺不错的，现在分享给大家，也给大家做个参考。
Problem
Given a complete binary tree, count the number of nodes.
Note:
Definition of a complete binary tree from Wikipedia:
In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. It can have between 1 and 2h nodes inclusive at the last level h.
Example:
Input:
1
/
2 3
/ /
4 5 6
Output: 6
Solution
class Solution {
public int countNodes(TreeNode root) {
if (root == null) return 0;
int height = 0;
TreeNode left = root.left, right = root.right;
while (left != null && right != null) {
height++;
left = left.left;
right = right.right;
}
if (left == null && right == null) return (1 << (height+1)) - 1;
else return 1 + countNodes(root.left) + countNodes(root.right);
}
}
以上是脚本宝典为你收集整理的[LeetCode] 222. Count Complete Tree Nodes全部内容，希望文章能够帮你解决[LeetCode] 222. Count Complete Tree Nodes所遇到的问题。
本图文内容来源于网友网络收集整理提供，作为学习参考使用，版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ：384754419，请注明来意。