Priority Queue || User Defined Data-type || Min/Max Heap || C++ STL || Competitive Programming

preview_player
Показать описание
00:00 - Intro
00:17 - Heap intro
03:40 - Min heap intro
04:40 - Max heap intro
06:05 - Code starts
06:42 - Max heap code
08:30 - Min heap code
10:12 - Using structure (user-defined) and comparator.

In this video, we are explaining the STL container priority_queue using which min/max heap is implemented fast, also using priority queue for user defined datatypes is explained.
This is very useful in competitive programming using which many types of problem can be solved.

Follow us on--

********************** credits ************************

#heap #priorityqueue #STL
Рекомендации по теме
Комментарии
Автор

Watch this video in 1.25x for better understanding in optimum time.

abhishektrivedi
Автор

There is a correction at 03:26 where parent-> i/2, it should be (i-1)/2 as we considered 0-based indexing, if we consider 1-based indexing then the parent of ith index node is at (i/2).

QuarantineEngineers
Автор

Bhai bahut badhiya tha sab samjh aa gaya

uttamchandravanshi
Автор

Bhaiya, competitive programming ki poori series bna do MATLAB pada do agar ho jae to ... please bhut bacchon ko fayda ho jaega ...

rajatagrwl
Автор

genuine things that happend during coding 😂😂#bloopers

swapniljain
welcome to shbcf.ru