There are $2$ "basic"/"fundamental" data structures due to the way memory works: array linked list Then there are ADT that we implement using those two, for example: stack, queue and more. When we arrive to priority queue we first need to implement and ADT called heap which can be implement ...