A Complete Binary Tree is a binary tree in which all levels are completely filled except possibly the last level, and the last level is filled from left to right. The height of a complete binary tree is log₂(N), where N is the number of nodes in the tree.
Key Properties of a Complete Binary Tree:
All levels except the last are completely filled:
If the tree has height h, then all levels from 0 to h-1 are fully filled.
Last level is filled from left to right:
In the last level, nodes are added from the leftmost side, and there may be some missing nodes on the right.
Height of the tree:
The height of a complete binary tree is log₂(N), where N is the number of nodes. This is because the tree is as balanced as possible.
Top comments (0)