Skip to main content

Stack vs Heap – Difference between Stack and Heap in Data Structure

In this tutorial you will learn about stack vs heap data structures.

Stack

Stack is a simple data structure used for storing data. In stack, the order in which the data arrives is important. A suitable example for stack is, a pile of plates in kitchen. When we want a plate we will take which was last placed in that pile. This is the main property of stack we say Last in first Out (LIFO) or First in Last out (FILO). So stack is a ordered list in which insertion and deletion are done at one end, called top.

Stack Operations:

Push: When an element inserted into the stack, we call it as push operation.

Top: When we want to know what is the top element of the stack we get it by top operation.

Pop: When we remove an element from the top of the stack, we call it as pop operation.

IsEmptyStack(): To check whether stack is empty or not.

IsFullStack(): To check stack is full or not.

And some other properties are,

Stack underflow: When we want to pop an element from the empty stack, that situation is called stack underflow.

Stack overflow: When we want to push an element to a full stack (i.e stack elements equal to stack size), that situation is called stack overflow.

Stack Data Structure

Also Read: Difference Between Stack and Queue

Heap

Heap is a tree with some special property. That special property of the heap is, the value of a node must be >= or <= to its children. And one most important property of heap is all leaves must be at level h or at h-1. (where h is the height of the tree). This also called heap must be a complete binary tree.

Types of Heaps:

Min Heap: The value of the node must be less than or equal to the values of its children.

Max Heap: The value of the node must be greater than or equal to the values of its children.

Finding minimum element, deleting minimum element, are easy operations in min heap.

Finding maximum element, deleting maximum element, are easy operations in max heap.

Binary Min Heap

Binary Min Heap

Binary Max HeapBinary Max Heap

Stack vs Heap – Difference between Stack and Heap

Stack Heap
1) Stack is a linear data structure. 1) Heap is a hierarchical data structure.
2) Elements in stack follow LIFO or FILO property. 2) Elements in heap follow heap property (mentioned above).
3) Push, Pop, Top are the only allowed operations on the stack. 3) Almost all tree operations can be applied on heaps. Heapifying an element, find minimum, find maximum are some examples.
4) All mentioned operations, push, pop, top, IsEmptyStack(), IsFullStack(), Size(), takes O(1) time in stack. 4) In heap, insertion takes O(log n) time. And finding min, deleting min (in min – heap), finding max, deleting max (in max – heap) takes O(1) time.
5) Stack can be implemented in 3 ways that, simple array based, dynamic array based and Linked list based implementation. 5) Heap can be implemented using arrays, and trees.
6) We can limit stack size, so that stack overflow, stack underflow conditions will occur. 6) There is no case of overflow and underflow in heap.
7) Balancing of symbols, infix – to – postfix conversions, undo sequence in a text editor, implementing function calls (especially recursion) are some applications of stacks. 7) Heaps can be useful for heapsort (best performance), selection algorithms (finding min, finding max, finding median, kth largest/smallest, etc), Graph algorithms.

Comment below if you have queries related to above tutorial for stack vs heap.

The post Stack vs Heap – Difference between Stack and Heap in Data Structure appeared first on The Crazy Programmer.



from The Crazy Programmer https://www.thecrazyprogrammer.com/2018/01/stack-vs-heap.html

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

dotnet sdk list and dotnet sdk latest

Can someone make .NET Core better with a simple global command? Fanie Reynders did and he did it in a simple and elegant way. I'm envious, in fact, because I spec'ed this exact thing out in a meeting a few months ago but I could have just done it like he did and I would have used fewer keystrokes! Last year when .NET Core was just getting started, there was a "DNVM" helper command that you could use to simplify dealing with multiple versions of the .NET SDK on one machine. Later, rather than 'switching global SDK versions,' switching was simplified to be handled on a folder by folder basis. That meant that if you had a project in a folder with no global.json that pinned the SDK version, your project would use the latest installed version. If you liked, you could create a global.json file and pin your project's folder to a specific version. Great, but I would constantly have to google to remember the format for the global.json file, and I'd constan...
Post a Comment
Read more

15 Web Design Trends to Watch in 2018

The modern world is full of extraordinary things that influence our imagination and mood. Our soul needs a perfect atmosphere and impressive spots. To apply such things in practice, we have submitted the list of the web trends that deserve your attention. Robert frost design analysis will meet all your wishes and expectations. Image Source Web Design Trends to Watch in 2018 1. More Organic Shapes Until this year, web design, as well as mobile design, were based on the right-angled and sharp-edged shapes. However, it seems that this year will bring some significant changes in the field of web design. The recent trends will offer the absolute rounded corners. In addition, the web design of 2018 will make the real things look like the cartoonish ones. 2.   Bold Minimalism Although some of you may think that this web design trend will not attract the Internet users. Indeed, the notion of minimalism is often associated with boredom and dullness. However, in this case, bold ...
Post a Comment
Read more

Data Encryption Standard (DES) Algorithm

Data Encryption Standard is a symmetric-key algorithm for the encrypting the data. It comes under block cipher algorithm which follows Feistel structure. Here is the block diagram of Data Encryption Standard. Fig1: DES Algorithm Block Diagram [Image Source: Cryptography and Network Security Principles and Practices 4 th Ed by William Stallings] Explanation for above diagram: Each character of plain text converted into binary format. Every time we take 64 bits from that and give as input to DES algorithm, then it processed through 16 rounds and then converted to cipher text. Initial Permutation: 64 bit plain text goes under initial permutation and then given to round 1. Since initial permutation step receiving 64 bits, it contains an 1×64 matrix which contains numbers from 1 to 64 but in shuffled order. After that, we arrange our original 64 bit text in the order mentioned in that matrix. [You can see the matrix in below code] After initial permutation, 64 bit text passed throug...
Post a Comment
Read more