Properties of binary trees

• A binary tree of n elements has ?? edges

  • exactly n-1

• The height/ depth of a binary tree is the number of levels in it. A binary tree of height h has at least ?? and at most ??? elements

  • at least h
  • at most 2h - 1

• The height of a binary tree with n elements is at most ?? and at least ???

  • at most n
  • at least ?log2 (n+1)?

Previous slide

Next slide

Back to first slide

View graphic version