O'Reilly logo

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

C++ Algorithm Series: Heaps

Video Description

Know the basics of C++ and want to further sharpen your skills? Then follow along with C++ expert Advait Jayant in his next course in the C++ Algorithm Series, and master how to work with heaps.

If you need to first develop a fundamental knowledge of C++, watch this excellent video on C++. Also here are all of Advait Jayant’s highly-rated videos on O’Reilly, including the full C++ Algorithm Series.

The following eight topics will be covered through a combination of lecture and hands-on to maximize your learning of heaps in C++:

  • Introducing Heaps in C++. This first topic in this C++ Heaps course explains the concept of heaps in C++, and contrasts heaps with arrays. A heap is a data structure which is responsible for the creation of priority queues. A heap is a complete binary tree (CBT). Learn about Min-Heap and Max-Heap properties.
  • Implementing Heaps in C++. This second topic in this C++ Heaps course explains how to implement heaps in C++. Follow along with Advait in this hands-on session as you create a heap and then insert new nodes into this heap.
  • Deleting Elements from a Heap in C++. This third topic in this C++ Heaps course explains how to delete elements from a heap in C++. Follow along with Advait in this hands-on session.
  • Using the Priority Queues Standard Template Library (STL) in C++. This fourth topic in this C++ Heaps course explains how to implement Heaps using the Standard Template Library (STL) in C++. Follow along with Advait in this hands-on session.
  • Using Functors and Solving the Bus-stop Problem using Heaps in C++. This fifth topic in this C++ Heaps course explains how to use Functors and solve the Bus-stop Problem in C++. Follow along with Advait in this hands-on session.
  • Finding the K-Largest Elements in a Running Stream using Heaps in C++. This sixth topic in this C++ Heaps course explains how to find the K-Largest elements in a running stream of integers using heaps in C++. Follow along with Advait in this hands-on session.
  • Merging K-Sorted Array using Heaps in C++. This seventh topic in this C++ Heaps course explains how to merge K-Sorted Array using heaps in C++. Follow along with Advait in this hands-on session.
  • Solving the Running Medians Problem using Heaps in C++. This eighth topic in this C++ Heaps course explains how to solve the Running Medians Problem using heaps in C++. Follow along with Advait in this hands-on session.