222. Count Complete Tree Nodes

题目：
Given a complete binary tree, count the number of nodes.

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.

解答：

public class Solution {//学了enum的方法哈哈public enum Direction {LEFT, RIGHT}public int getDepth(TreeNode root, Direction dir) {int depth = 0;//这里是从root开始算起，所以求出来的结果是实际depth + 1while (root != null) {depth++;if (dir == Direction.LEFT) {root = root.left;} else {root = root.right;}}return depth;}public int countNodes(TreeNode root) {if (root == null) return 0;int leftDepth = getDepth(root, Direction.LEFT);int rightDepth = getDepth(root, Direction.RIGHT);if (leftDepth == rightDepth) {//1 << leftDepth是2^(leftDepth)return (1 << leftDepth) - 1;} else {//这一步很巧妙，把根结点加上，然后分治左结点和右结点，如果是叶子结点，在countNodes中就返回1return 1 + countNodes(root.left) + countNodes(root.right);}}
}

222. Count Complete Tree Nodes相关推荐

【LeetCode】222. Count Complete Tree Nodes 解题报告（Python）
[LeetCode]222. Count Complete Tree Nodes 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个 ...
Middle-题目95：222. Count Complete Tree Nodes
题目原文: Given a complete binary tree, count the number of nodes. 题目大意: 给出一个完全二叉树,求节点数. 题目分析: 如果直接递归数节点 ...
leetcode 222 Count Complete Tree Nodes
今天做了一道leetcode题,刚开始是暴力破解,发现special judge, very large tree 过不去,然后一顿想,一顿查,发现可以运用complete binary tree 的 ...
222 Count Complete Tree Nodes
1,这道题如果纯用递归数点而不利用其为一个complete binary tree的话会超时. 2.为了利用这个条件,比较左右两子数的高度:1, 如果相等则左子树为完全二叉树 2, 如果不等, 则右子 ...
LeetCode 222. Count Complete Tree Nodes 题解——Java
题目链接:https://leetcode.com/problems/count-complete-tree-nodes/#/description 题目要求:计算完全二叉树的节点个数思路:首先想到 ...
leetcode 222. Count Complete Tree Nodes | 222. 完全二叉树的节点个数（Java）
题目 https://leetcode.com/problems/count-complete-tree-nodes/ 题解思路参考左程云<程序员代码面试指南> 顺便贴一下草稿代码 c ...
Count Complete Tree Nodes
https://leetcode.com/problems/count-complete-tree-nodes/ 宽度优先搜索方法,超时!! /*** Definition for a binary ...
LeetCode Count Complete Tree Nodes(二分法)
问题:给出一个完全二叉树,求其结点个数思路:第一种方式时直接使用递归法,将其左子树个数加上右子树个数再加上根结点第二种方式二分法,因为完全二叉树除了最后一层外,其它都满足有2^i个结点,而最后一层 ...
LeetCode题解-222-Count Complete Tree Nodes
没有做出来,所以参考了https://segmentfault.com/a/1190000003818177 迭代法的图解如下:

222. Count Complete Tree Nodes

222. Count Complete Tree Nodes相关推荐

最新文章

热门文章