C++ Priority Queue - Four Implementation Options

A demonstration of how to tell if a heap is well formed. Note that the underlying data structure of the standard template library priority queue class is a heap. You can learn more about the heap and other data structures in C++ Data Structures by James Helfrich: https://he.kendallhunt.com/product/c-data-structures 0:00 Introduction 0:15 Four Implementation Options 2:19 UML Class Diagram - Priority Queue 3:19 UML Class Diagram - Container 5:05 Conclusion