Please enable JavaScript.

Coggle requires JavaScript to display documents.

STACKS AND QUEUES - Coggle Diagram

- - - - LIFO
    - - function call stack in programming language .
      - browsing history .
      - undo ,redo concept to go to previous and next step.
    - - can be implemented by Array and Linkedlist
        
        preferred implementation
        
        Array because it push pop method has complexity of O(1) , also its access is fast .
  - - - FIFO
    - - in event loop callback stack .
    - - can be implemented by Array or Linkedllist
        
        preferred implementation
        
        Linked list because in QUEUE first item is removed first , if we use array here then all the items indexes is shifted ,and by using linked list we we simply change the head .