Check if a binary tree is complete

Q: Check if a binary tree is complete

This question evaluates understanding of binary tree properties and traversal techniques, testing competency in data structures and algorithmic reasoning related to tree completeness.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

You are given the root of a binary tree. Determine whether the tree is a complete binary tree.

A binary tree is complete if:

Every level, except possibly the last, is completely filled.
All nodes in the last level are as far left as possible.

Input

root : root node of a binary tree (or null ).

Output

Return true if the tree is complete; otherwise return false .

Constraints

Number of nodes: 0..10^5
Node values are irrelevant to completeness.

Notes

Aim for an algorithm that is correct for large trees; discuss time complexity and space usage (e.g., typical BFS approach vs. any space optimizations).

Check if a binary tree is complete

Quick Overview

Input

Output

Constraints

Notes

Comments (0)