Is it really important to learn the implementation of all the data structures like heaps, queues, vectors etc. when we already have the STL for each of them which is much easier to use?
And are heaps and priority queues the same thing?
Data Structures Implementation
@tanyaa.sood learning implementation will give you an idea of the inner working of each data structure and how the time complexity of each operation differs, so you can choose data structures carefully according to your needs. In practice, you’ll always use STL but it is still important to have some idea about how its being implemented.
Yes heaps and priority queues are the same thing.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.