## How to implement max-heap using C++ STL?

A max-heap is a binary tree such that:1. The data contained in each node is greater than (or equal to) the data in that node’s children.2. The binary tree is complete The C++ Standard Library consists of a container named priority_queue. A priority queue is a max-heap. Example of a heap using priority queue: Output: