Please enable JavaScript.

Coggle requires JavaScript to display documents.

Lists, Stacks, and Queues - Coggle Diagram

- - - - Dynamic memory allocation
      - Nodes: series of objects
    - - Expensive to use
    - - Array-based
        
        Have the disadvantage that their size must be predetermined
        before the array can be allocated
        
        Cannot grow beyond their predetermined size
        
        There is no wasted space for an individual element
        
        When the array for the array-based list is completely
        filled, there is no storage overhead
      - Linked list
        
        Only need space for the objects actually on the list
        
        No limit to the number of elements on a linked list, as long as there is free-store memory available
        
        require that an extra pointer be added to every list node
      - n > DE/(P + E)