Skip to content

A heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: in a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min-heap, the key of P is less than or equal to the key of C. The node at th…

Notifications You must be signed in to change notification settings

ArpanMaheshwari144/Heap-Data-Structure

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Heap-Data-Structure

Installation

You only need MinGW in your system. If you do not have MinGW you can download it from there. Download according to your system specification.

Getting Started

  • Once you download MinGW install it.
  • Then go to this location(C:\MinGW\bin).
  • Copy that path and paste it to your user/system environment variables where ever you want.
  • If everything is fine, run the following command on your CMD and Terminal:
g++

These commands will show only a fatal error. If these commands do not show a fatal error or some other kind of error, so please make sure you have done all the above steps correctly.

  • If you are done all the steps correctly, you will not face any difficulty at all.
  • Then download the code and run it in your favorite editor.
  • Open your code editor terminal, if your code editor has no terminal so open CMD and locate to that folder which has the files of C++ programs. Then run the following command:
g++ filename
  • This command will compile your code and in your code folder, one file as a.exe was made.
  • Then type 'a' in your terminal and hit the tab button. Your program runs successfully.

Documentation

For more information, Please refer to the C++ docs.
Click here to know more about Heap Data Structure.

About

A heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: in a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min-heap, the key of P is less than or equal to the key of C. The node at th…

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages