To allow for efficient insertion and deletion of elements
Follows Last In First Out (LIFO) principle
Heap
O(log n)
Array
To represent connections between nodes
Stack
Trees have a root node, while graphs do not
Queue
Follows First In First Out (FIFO) principle