Heap in C++ STL | make_heap(), push_heap(), pop_heap(), sort_heap(), is_heap, is_heap_until()

Heap is one of the most popular data structures in C++ or in any other programming languages so to say. There is a possibility of performing many operations in heap such as deleting, updating the data in the Heap data Structure with the help of in-built functions such as make_heap(), push_heap(),pop_heap(), sort_heap(), is_heap, is_heap_until(). The implementation of the functions in the Heap data structure in C++ language is given below.

C++ code

// Here we are writing down the C++ Programming language code
// To demonstrate the concept of Heap in C++ STL | make_heap(),
//push_heap(),pop_heap(), sort_heap(), is_heap, is_heap_until()
#include<bits/stdc++.h>
using namespace std;
//The main code functionality starts from here
int main()
{
	
	// the below structure to create a vector is statically
	// used to create the vector of elements listed below
	vector<int> v1 = {240, 360, 5440, 525, 115};
	

	// the below small code snippet helps us with converting 
	// the to a heap from a vector using the C++ in built-in
	// function make_heap()
	make_heap(v1.begin(), v1.end());
	
	// Displaying the maximum element of the heap
	// using front()
	// the below cout statements help us with displaying the 
	// maximum or the highest element that we have in our
	// heap, which we have created
	cout << "highest element in a heap created by us is: ";
	cout << v1.front() << endl;
	
	return 0; }

Output:

the highest element in a heap created by us is: 5440

C++ code

// Here we are writing down the C++ Programming language code
// To demonstrate the concept of Heap in C++ STL | make_heap(),
//push_heap(),pop_heap(), sort_heap(), is_heap, is_heap_until()
#include<bits/stdc++.h>
using namespace std;
//The main code functionality starts from here
int main()
{
	
              // the below structure to create a vector is statically
	// used to create the vector of elements listed below

	vector<int> v1 = {2540, 6650, 4460, 2665, 9915};
	
	// the below small code snippet helps us with converting 
	// the to a heap from a vector using the C++ in built-in
	// function make_heap()

	make_heap(v1.begin(), v1.end());

	// the below cout statements help us with displaying the 
	// maximum or the highest element that we have in our
	// heap, which we have created

	cout << "highest element in the heap created by us is: ";
	cout << v1.front() << endl;
	
	// the below small cos=de snippet helps us with using 
	// the push_back() function in C++ to enter the elements
	// in vector
	v1.push_back(50);
	
	// the below small code helps us with using the built-in
	// push_heap() to 
	// reorder elements in the vector which we have created
	push_heap(v1.begin(), v1.end());
	
	// the below cout statements help us with displaying the 
	// maximum or the highest element that we have in our
	// heap, which we have created after performing dot front
	cout << "highest element in a heap after performing the operation is: ";
	cout << v1.front() << endl;
	
	// the below small code snippet helps us with
	// using pop_heap() to delete maximum element
	// from the heap which we have created 
	pop_heap(v1.begin(), v1.end());
	v1.pop_back();
	

	// the below cout statements help us with displaying the 
	// maximum or the highest element that we have in our
	// heap, which we created after performing the pop
	// operation in a heap is

	cout << "highest element in the heap after performing pop operation is: ";
	cout << v1.front() << endl;
	
	return 0;
}

Output:

the highest element in a heap created by us is: 9915
the highest element in a heap after operating is: 9915
the highest element in a heap after performing the pop operation is: 6650

C++ code

// Here we are writing down the C++ Programming language code
// To demonstrate the concept of Heap in C++ STL | make_heap(),
//push_heap(),pop_heap(), sort_heap(), is_heap, is_heap_until()
#include<bits/stdc++.h>
using namespace std;
//The main code functionality starts from here
int main()
{
	
	// the below structure to create a vector is statically
	// used to create the vector of elements listed below
	vector<int> v1 = {2540, 6650, 4460, 2665, 9915};
	
	// the below small code snippet helps us with converting 
	// the to a heap from a vector using the C++ in built-in
	// function make_heap()
	make_heap(v1.begin(), v1.end());
	
    // the below cout statements help us with displaying the 
	// maximum or the highest element that we have in our
	// heap, which we have created

	cout << "The heap elements are : ";
	for (int &x : v1)
	cout << x << " ";
	cout << endl;
	

	sort_heap(v1.begin(), v1.end());
	
	// Displaying heap elements
	cout << "The heap elements after sorting are : ";
	for (int &x : v1)
	cout << x << " ";
	
	return 0;
}

Output:

The heap elements are: 9915 6650 4460 2665 2540 
The heap elements after sorting are: 2540 2665 4460 6650 9915

Next TopicHow does 'void*' differ in C and C++

← prev next →

For Videos Join Our Youtube Channel: Join Now

Feedback

Send your Feedback to [email protected]

Help Others, Please Share

Learn Latest Tutorials

Splunk

SPSS

Swagger

Transact-SQL

Tumblr

ReactJS

Regex

Reinforcement Learning

R Programming

RxJS

React Native

Python Design Patterns

Python Pillow

Python Turtle

Keras

Preparation

Aptitude

Reasoning

Verbal Ability

Interview Questions

Company Questions

Trending Technologies

Artificial Intelligence

AWS

Selenium

Cloud Computing

Hadoop

ReactJS

Data Science

Angular 7

Blockchain

Git

Machine Learning

DevOps

B.Tech / MCA

DBMS

Data Structures

DAA

Operating System

Computer Network

Compiler Design

Computer Organization

Discrete Mathematics

Ethical Hacking

Computer Graphics

Software Engineering

Web Technology

Cyber Security

Automata

C Programming

C++

Java

.Net

Python

Programs

Control System

Data Mining

Data Warehouse

^{Like/Subscribe us for latest updates or newsletter}

C++ Tutorial

C++ Control Statement

C++ Functions

C++ Arrays

C++ Pointers

C++ Object Class

C++ Inheritance

C++ Polymorphism

C++ Abstraction

C++ Namespaces

C++ Strings

C++ Exceptions

C++ Templates

Signal Handling

C++ File & Stream

C++ Misc

C++ STL Tutorial

C++ Iterators

C++ Programs

MCQ

Interview Question

Heap in C++ STL | make_heap(), push_heap(), pop_heap(), sort_heap(), is_heap, is_heap_until()

Feedback

Help Others, Please Share

Learn Latest Tutorials

Preparation

Trending Technologies

B.Tech / MCA