Please enable JavaScript.

Coggle requires JavaScript to display documents.

LISTS, STACKS, QUEUES - Coggle Diagram

- - - - Array-based lists have a limit predetermined of their size, thats 1x0 to linked lists, but they dont waste size, so 1x1
      - Review this after studying pointers:
        
        Given a pointer to a suitable location in the list, the insert and remove
        
        methods for linked lists require only Θ(1) time. Array-based lists must shift the remainder of the list up or down within the array. This requires Θ(n) time in the average and worst cases. For many applications, the time to insert and delete elements
        
        dominates all other operations. For this reason, linked lists are often preferred to
        
        array-based lists.
  - - - dynamic memory allocation ( essential )
        
        Same nomenclatures: Head, tail, append
        
        The difference is at the remove and insert functions
        
        Inserting a new element is a three-step process. First, the new list node is
        created and the new element is stored into it. Second, the next field of the new
        list node is assigned to point to the current node (the one after the node that curr
        points to). Third, the next field of node pointed to by curr is assigned to point to
        the newly inserted node.
        
        curr->next = new Link<E>(it, curr->next);