Priority Queue | C++ STL (Standard Template Library) | std::priority_queue

preview_player
Показать описание
In this lesson we study about priority_queue container adaptor and different functions of priority queue.

#stl #priority_queue #standardtemplatelibrary #CPP #FIFO
Рекомендации по теме
Комментарии
Автор

the only no-nonsense STL priority queue video.
Thanks!

saurabhmahra
Автор

all concepts are clear in one video. amazing content

RahulSingh-vvjj
Автор

10:33 ----> WHats this syntax Q(cmp)? why you didn't just declare this std::priority_queue<int, vector<int>, cmp> Q; ?

testshar
Автор

Hi,
I really appreciate all the hardwork. Please do more recursion some problem. Someone tricky ones are:
Letter Combinations of a phone number and restore ip addresses.

floatingpoint
Автор

Sir no videos since 3 days what happened?

raviashwin
Автор

Why we dont have method to delete any element from this priority_queue? If we implement this on our own using heap, we can have delete in O(n).

bestsaurabh
Автор

Have you implemented this priority queue using stack?

nitishkushwaha
Автор

what about circular queue and heaps ? using stl.

Safh
Автор

nice explanation

but didnt understand
[ ](int a, int b)
this code

PegasiuuuS