Overview

complete tree


Show Summary Details

Quick Reference

Any tree constructed from a full tree of depth k by deleting some of the leaf nodes and the arcs leading to them. In a complete binary tree, the deleted nodes are often constrained to be the rightmost terminal (leaf) nodes.

The term is also sometimes used as a synonym for full tree.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.