Find Max Items and Max Height of a Completely Balanced Binary Tree

Share this video with your friends

Send Tweet

A balanced binary tree is something that is used very commonly in analysis of computer science algorithms. In this lesson we cover how to determine the maximum number of items it can accommodate.

We follow this with a discussion on the maximum height of a binary tree given we need to accommodate n items.