Properties of binary trees

• A binary tree of n elements has n-1 edges

• A binary tree of height h has at least h and at most 2h - 1 elements

• The height of a binary tree with n elements is at most n and at least ?log2 (n+1)?

Previous slide

Next slide

Back to first slide

View graphic version