Learning Path Blogs Premium Login

Hide Index

Heap

0% completed

Introduction to heaps

Understanding the problem

Exploring a possible solution

Understanding a heap

Overview of supported operations

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

Tree heap validator

Pattern: Kth element

Kth largest element

K most frequent elements

K smallest sum pairs

K sorted array sorting

K arrays smallest range

Pattern: Data stream

Design a kth largest finder

Design a median finder

Pattern: Conversion

BST to min heap

Min heap to max heap

Max heap to min heap

Pattern: Design

Design a min heap

Design a max heap

Assessments

Certificate

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