Properties of Binary Trees

• If T has k nodes, then it has k-1 edges. (This is actually true for any kind of tree.)

• A full binary tree of height h is a binary tree whose root has height h and which contains 2h+1-1 nodes.

• A complete binary tree with k nodes consists of a full binary tree plus 0 or more nodes that are children of the (leftmost) deepest elements of the full tree. (A complete binary tree can be thought of as a “prefix” of some full binary tree, scanning elements in level order.)

Previous slide

Next slide

Back to first slide

View graphic version