LeetCode 958. Check Completeness of a Binary Tree

本文转载自查看原文 2019-07-07 07:22 436 Tree/ LeetCode

原题链接在这里：https://leetcode.com/problems/check-completeness-of-a-binary-tree/

题目：

Given a binary tree, determine if it is a complete binary tree.

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 1:

Input: [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: [1,2,3,4,5,null,7]
Output: false Explanation: The node with value 7 isn't as far left as possible.

Note:

The tree will have between 1 and 100 nodes.

题解：

Perform level order traversal on the tree, if popped node is not null, then add its left and right child, no matter if they are null or not.

If the tree is complete, when first met null in the queue, then the rest should all be null. Otherwise, it is not complete.

Time Complexity: O(n).

Space: O(n).

AC Java:

 1 /**
 2  * Definition for a binary tree node.
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 class Solution {
11     public boolean isCompleteTree(TreeNode root) {
12         LinkedList<TreeNode> que = new LinkedList<TreeNode>();
13         que.add(root);
14         while(que.peek() != null){
15             TreeNode cur = que.poll();
16             que.add(cur.left);
17             que.add(cur.right);
18         }
19         
20         while(!que.isEmpty() && que.peek() == null){
21             que.poll();
22         }
23         
24         return que.isEmpty();
25     }
26 }

类似Complete Binary Tree Inserter.

免责声明！

本站转载的文章为个人学习借鉴使用，本站对版权不负任何法律责任。如果侵犯了您的隐私权益，请联系本站邮箱yoyou2525@163.com删除。

猜您在找 [LeetCode] 958. Check Completeness of a Binary Tree 检查二叉树的完全性 [Leetcode] Balanced Binary Tree LeetCode Balanced Binary Tree [leetcode]Balanced Binary Tree @ Python leetcode 30 days challenge Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree [LeetCode] Validate Binary Search Tree LeetCode:Recover Binary Search Tree LeetCode Binary Tree Inorder Traversal [LeetCode] Minimum Depth of Binary Tree [LeetCode] Binary Tree Postorder Traversal