Please enable JavaScript.
Coggle requires JavaScript to display documents.
Fundamentos da estrutura de dados - Coggle Diagram
Fundamentos da estrutura de dados
estrutura linear de dados
vetor
linked list
linked list is a sequence of zero or more elements called nodes, each
containing two kinds of information: some data and one or more links called
pointers to other nodes of the linked list
Lista
stack
inserção e retiradas somente no começo ou no final da lista (LIFO)
ex uma pilha de pratos
indispensável para implementação de algoritmos rercursivos
uma serieação finita de dados armazenados, possui dois tipo principais
queue
A queue, on the other hand, is a list from which elements are deleted from
one end of the structure, called the front (this operation is called dequeue),
and new elements are added to the other end, called the rear (this operation is
called enqueue). Consequently, a queue operates in a “first-in–first-out” (FIFO)
fashion—akin to a queue of customers served by a single teller in a bank. Queues
also have many important applications, including several algorithms for graph
problems