Please enable JavaScript.
Coggle requires JavaScript to display documents.
Mapa Mental 6 - Coggle Diagram
Mapa Mental 6
Lists
-
Unidimensional, multidimensional, dinamics
-
Inserting and removing stuff can be complicated, specially in the beginning/end of the array
-
Search sits at O(n) complexity. In the worst case, inserting and removing is also O(n)
Queues
Based on the FIFO principle (first in, first out)
Main operations: Enqueue (insert on the beginning), dequeue (remove the first element)
Simple queue, circular queue, double queue and priority queue are some tipes of queues that exists
It is useful for sequential processing and label organization. But in simple queues, the removal of elements can be very tricky
The complexity is O(n) for most cases, except for O(1) in case of linked lists
Linked Lists
-
Linked lists are simple linked, double linked and circular
Each knot uses a pointer to keep track of the next one, or the one that came before in case of a linked list.
It has a efficient way to remove elements, and the growth is dynamic
-
Stacks
Based on the LIFO principle (last in, first out)
Time complexity of O(n) for access and search, but a O(1) for push/pop
Its main operations are: push (insert an element on the top of the stack), pop (remove the top element of the stack) and Peek (return the first element without removing it)
-