complete binary tree
A complete binary tree is a binary tree in which all levels, except possibly the last one, are completely filled, and all nodes in the last level are as far left as possible.
Requires login.
Related Concepts (7)
Similar Concepts
- balanced binary heap
- balanced binary tree
- balanced binary trees
- balancing binary trees
- binary heap trees
- binary search tree
- binary search trees
- binary tree properties
- binary tree representation
- binary trees
- complete binary trees
- full binary trees
- perfect binary tree
- perfect binary trees
- threaded binary trees