958. Check Completeness of a Binary Tree

Medium

3.8K

51

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 `2`

nodes inclusive at the last level ^{h}`h`

.

**Example 1:**

Input:root = [1,2,3,4,5,6]Output:trueExplanation: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:falseExplanation: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`

Accepted

194.8K

Submissions

346.8K

Acceptance Rate

56.2%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved