Leetcode Problem 958. Check Completeness of a Binary Tree

958. Check Completeness of a Binary Tree

Leetcode Solutions

If the root is null, return true as an empty tree is a complete binary tree.
Initialize a queue and add the root to it.
Initialize a boolean flag nullNodeFound to false.
While the queue is not empty: a. Dequeue the front node from the queue. b. If the node is null, set nullNodeFound to true. c. If the node is not null: i. If nullNodeFound is true, return false as we have found a non-null node after a null node. ii. Otherwise, enqueue the left and right children of the node.
If the loop completes without returning false, return true.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen