Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

FAANG Interview DSA Series - Heap Sort, Binary Tree, Min Heap and Max Heap Tree and Interview Questions

Krish Naik via YouTube

Start learning Write review
Coursera Ad

AI, Data Science & Cloud Certificates from Google, IBM & Meta

Learn More → Corporate Finance Institute Ad

Learn Excel and Financial Modeling the Way Finance Teams Actually Use Them

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This course introduces heaps as complete binary trees, covering min- and max-heap insertion, deletion, construction, and time-complexity analysis. It applies these concepts to heap sort and the Top K Frequent Elements and K Closest Points to Origin problems.

Syllabus

Basics of Heap Sort - Full Binary Tree vs Complete Binary Tree vs Almost Complete Binary Tree
Concept of Minheap and Maxheap Tree
Insertion in Minheap or Maxheap Tree
Deletion in Minheap or Maxheap Tree
Creation of Minheap or Maxheap Tree
Time Complexity Derivation to build minheap or maxheap
Comparison Sort - Heap Sort
Interview Question - Top K frequent elements
Interview Question - K Closest Points to Origin

Taught by

Krish Naik

Reviews

Start your review of FAANG Interview DSA Series - Heap Sort, Binary Tree, Min Heap and Max Heap Tree and Interview Questions

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.