LeetCode每日一题(Check Completeness of a Binary Tree)

最新推荐文章于 2022-03-31 09:58:37 发布

原创最新推荐文章于 2022-03-31 09:58:37 发布 · 149 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

算法专栏收录该内容

413 篇文章

订阅专栏

给定一棵二叉树的根节点，判断该树是否为完全二叉树。完全二叉树的特点是除最后一层外，每一层都被完全填充，且所有结点都尽可能地集中在左侧。例如，输入为[1,2,3,4,5,6]，返回true，而输入为[1,2,3,4,5,null,7]，返回false。" 103377953,9192982,大数据技术详解与存储平台,"['大数据', '存储技术', '分布式计算', 'Hadoop', '数据库']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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，否则一定不是完全二叉树

代码实现(Rust):

impl Solution {
    pub fn is_complete_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
        let mut next_level: Vec<Option<Rc<RefCell<TreeNode>>>> = vec![root];
        let mut temp = Vec::new();
        let mut got_none = false;
        loop {
            while !next_level.is_empty() {
                if let Some(n) = next_level.remove(0) {
                    if got_none {
                        return false;
                    }
                    temp.push(n.borrow_mut().left.take());
                    temp.push(n.borrow_mut().right.take());
                } else {
                    got_none  = true;
                }
            }
            if temp.is_empty() {
                return true
            }
            next_level = temp.clone();
            temp.clear();
        }
    }
}