Hide Index

Heap

0% completed

Introduction to heaps

Understanding the problem

Exploring a possible solution

Understanding a heap

Overview of supported operations

Tree heap validator

Array implementation of heaps

Structure of array based heap

Inserting an item in the heap

Deleting an item from the heap

Peeking the top item in the heap

Extracting the top item from the heap

Constructing a heap

Design a max heap

Design a min heap

Pattern: Heapification

Min heap to max heap

Max heap to min heap

Pattern: Kth element

Kth largest element

Design a kth largest finder

K sorted array sorting

Pattern: Custom compare

K most frequent elements

K smallest sum pairs

K closest values

K arrays smallest range

Design

Design a median finder

Assessments

Certificate

Liking the course? Check our discounted plans to continue learning.