complete binary tree

RU: полное двоичное дерево

A binary tree where all levels are completely filled except possibly the last, which is filled from left to right. Every level has the maximum number of nodes, and the last level is filled sequentially with no gaps.