Binary Tree Terminology
A binary tree of height h ³ 0 has size at least h
A binary tree of height at most h ³ 0 has size at most 2h - 1
A binary tree of size n ³ 0 has height at most n
A binary tree of size n ³ 0 has height at least é log (n + 1) ù
Previous slide
Next slide
Back to first slide
View graphic version