1
Understand the FizzBuzz coding problem and its solution
4m 19s
2
Sort arrays in TypeScript
3m 54s
3
Case insensitive sorting for string arrays
1m 33s
4
Determine if two strings are an anagram
3m 52s
5
Determine if a string is a palindrome
3m 35s
6
Bubble sort using TypeScript
3m 25s
7
Quicksort algorithm using TypeScript
5m 49s
8
Insertion sort algorithm using TypeScript
3m 43s
9
Merge sort algorithm using TypeScript
5m 39s
10
Binary Search Algorithm using TypeScript
3m 5s
11
Find the repeated item in an array using TypeScript
1m 44s
12
Create random integers in a given range
1m 53s
13
Stack implementation using TypeScript
2m 8s
14
Queue implementation using TypeScript
3m 34s
15
Implement a singly linked list in TypeScript
4m 15s
16
Implement a doubly linked list in TypeScript
3m 36s
17
Parse a string to an integer
3m 50s
18
Shuffle an array
3m 58s
19
Implement the heap data structure using JavaScript
11m 43s
20
Find Max Items and Max Height of a Completely Balanced Binary Tree
3m 26s
21
Implement the Heapsort algorithm using TypeScript / JavaScript
2m 28s
22
Minimum / Maximum Maintenance algorithm implementation using JavaScript / TypeScript
4m
23
Sum of the most common algorithmic arithmetic series
2m 43s
24
Median Maintenance algorithm implementation using TypeScript / JavaScript
5m 47s
25
Maximum Contiguous Subarray algorithm implementation using TypeScript / JavaScript
6m 21s

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

TypeScript^2.1.4

Share this video with your friends

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.

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

Share this video with your friends

Course

Build Algorithms using Typescript