给定一棵二叉树的根节点，判断该树是否为完全二叉树。完全二叉树的特点是除最后一层外，每一层都被完全填充，且所有结点都尽可能地集中在左侧。例如，输入为[1,2,3,4,5,6]，返回true，而输入为[1,2,3,4,5,null,7]，返回false。"
103377953,9192982,大数据技术详解与存储平台,"['大数据', '存储技术', '分布式计算', 'Hadoop', '数据库']
Given the root of a binary tree, determine if it is a complete binary tree.
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 1:
Input: root = [1,2,3,4,5,6]
Output: true
Explanation: Every level before the last is full (ie. levels with node-values {1} and {2, 3}), and all nodes in the last level ({4, 5, 6}) are as far left as possible.
Example 2:
Input: root = [1,2,3,4,5,null,7]
Output: false
Explanation: The node with value 7 isn’t as far left as possible.
Constraints:
- The number of nodes in the tree is in the range [1, 100].
- 1 <= Node.val <= 1000
- BFS 遍历整棵树
- 遍历过程中只要遇到一个是 None 的节点， 那剩下的节点必须都是 None， 否则一定不是完全二叉树
最低0.47元/天 解锁文章
347
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
