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

YouTube

Heaps in C++ - Interview Questions - Part 1

CodeHelp - by Babbar via YouTube

Start learning Write review
Coursera Ad

Learn AI, Data Science & Business — Earn Certificates That Get You Hired

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 solves five binary heap problems in C++, presenting problem-solving approaches and code implementations. Topics include kth smallest elements, merging heaps, checking whether a binary tree is a heap, minimum rope-joining cost, and converting a BST into a heap.

Syllabus

- Question 1
- Promotion
- Approach #1
- Approach #2
- Code
- Question 2
- Approach
- Code
- Question 3
- Approach
- Code
- Question 4
- Approach
- Code
- Question 5
- Approach

Taught by

CodeHelp - by Babbar

Reviews

Start your review of Heaps in C++ - Interview Questions - Part 1

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.