Please enable JavaScript.
Coggle requires JavaScript to display documents.
(M6) CHAPTER 4 - STACKS - Coggle Diagram
(M6) CHAPTER 4 - STACKS
STACKS IS A LIST-LIKE
ELEMENTS ARE INSERTED AND REMOVED ONLY FROM THE END
MORE EFFICIENT
EASY TO IMPLEMENT
LESS FLEXIBLE
ALL OPERATIONS COST Θ(1)
LAST IN FIRST OUT - LIFO
"PUSHED" AND "POPPED"
ARRAY-BASED STACKS
FIXED SIZE
IT CAN STORE TWO STACKS IN ONLY ONE ARRAY
ONE OF THEM MUST GROW AND THE OTHER MUST SHRINK
LINKED STACKS
INSERTION AND REMOVAL FROM THE HEAD OF THE LIST
QUEUES
FIRST IN FIRST OUT - FIFO
"ENQUEUE" AND "DEQUEUE"
ELEMENTS ARE INSERTED AT THE BACK AND REMOVED FROM THE FRONT
ARRAY-BASED QUEUE
CONTENT WILL "DRIFT" IN THE ARRAY
IT CAN BE SIGHT LIKE A CIRCLE, THE END TOWARDS TO THE BEGINING
LINKED QUEUE
IT HAS A HEADER LINK NODE