Heap Explained and Implemented in Java | Maximum and Minimum Heaps | Priority Queues | Geekific

Support us on Patreon: / geekific
GitHub Repository: github.com/geekific-official/...
Stay updated on our videos by subscribing to the channel and hitting the like button!
In the previous videos of this series we tackled various implementations of the binary tree, such as Binary Search Trees, AVL trees and Red-Black Trees. Therefore, in this video, we explain and implement and additional application of binary trees known as: Heaps.
Timestamps:
00:00 Introduction
00:23 What are Heaps?
01:53 What are Priority Queues?
02:47 Heaps Representation
04:08 Inserting an item into the Heap
04:56 Deleting an item from the Heap
05:48 Max and Min Heap Implementation
07:27 The Insert Operation Implemented
10:22 The Retrieve/Delete Operation Implemented
14:03 HeapSort Explained and Implemented
16:28 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Generics and Wildcards in Java Made Simple: • Generics and Wildcards...
- Project Lombok Annotations Explained: • Project Lombok Annotat...
- Graphs - The Fundamentals: • Introduction to Graphs...
- Introduction to Trees, Basic Tree Terminology and Different Types of Trees: • Introduction to Trees ...
- Binary Search Trees (BST) Explained and Implemented in Java: • Binary Search Trees (B...
- AVL Trees Explained and Implemented in Java: • AVL Tree Explained and...
#Geekific #Heaps #DataStructures #MaximumHeap #MinimumHeap #Java

[@TuanNguyen-ie2zm]

Your voice is very clearly and easy to hear, thanks so much for these explanation, very useful. Never get bored while learning with your videos

[@guilhermealvessilveira8938]

You code is really good, it's easy to undestand. Good work!

[@geekific]

Glad you think so! Thanks a lot :)

[@justinstorm]

Thank you. Very helpful in understanding

[@geekific]

Glad it was helpful!

[@th2315]

you are awesome

[@niranjankumar-uk8sk]

prirotyqueuepq=new Priorityqueue(a,b)->(a[0]-b[0]) ca u explain sir what does it mean how values are add

[@geekific]

Hello! This does not figure anywhere in this video. However, this a priority queue that stores arrays of ints, and the comparator passed to the constructor uses the very first element of every array stored in the queue to determine its priority and poll the elements accordingly. Cheers!