Explore the full potential of C++ by mastering the standard library.

Become a C++ Programmer

The C++ standard library is a collection of all the tools and utilities available in C++. It received its latest update in 2017, known as C++17. The update introduces many new features that further optimize our code. This module will help us fully grasp C++ and use it to its full potential.

C++ Standard Library

![](images/privat/heap.png)

> ℹ️ **What is a heap?**
>\
> A heap is a binary search tree in which parent elements are always bigger than its child elements. Heap trees are optimized for the efficient sorting of elements.

You can create with `std::make_heap` a heap. You can push with `std::push_heap` new elements on the heap. On the contrary, you can pop the largest element with `std::pop_heap` from the heap. Both operations respect the heap characteristics. `std::push_heap` moves the last element of the range on the heap; `std::pop_heap` moves the biggest element of the heap to the last position in the range. You can check with `std::is_heap` if a range is a heap. You can determine with `std::is_heap_until` until which position the range is a heap. `std::sort_heap` sorts the heap. 

The heap algorithms require that the ranges and the algorithm use the same sorting criterion. If not, the program is undefined. Per default, the predefined sorting criterion `std::less` is used. If you use your sorting criterion, it has to obey the [strict weak ordering](https://en.wikipedia.org/wiki/Weak_ordering). If not, the program is undefined. 

Creates a heap from the range:

This is another popular data structure implemented in C++ using an range.

Heaps