What are the most important Data Structures?
Arrays
An array is a linear data structure that holds an ordered collection of values. It’s the most efficient in storing and accessing a sequence of objects.
Stacks
A stack is a linear data structure that follows a particular order in which operations are performed. The order could be Last In First Out (LIFO), or First In Last Out (FILO).
Queues
A queue is an abstract data structure, similar to a stack - only queues are open at both ends. One end is for inserting data (enqueue), and the other end is for removing data (dequeue). The operations follow the First In First Out (FIFO) order.
Linked Lists
A linked list is a linear data structure in which elements are not stored in sequential memory locations. Elements are linked using pointers.
Graphs
A graph is a non-linear data structure containing nodes and edges. Nodes are sometimes called “vertices” and the edges connect any two nodes in the graph.
Trees
A tree is a nonlinear data structure made up of nodes and edges. Each node contains a value or data, and may (or may not) have a child node.
Tries
A trie is a tree-like data structure, with nodes that store the letters of an alphabet. Words and strings can be reTRIEved from the structure by traveling down a branch path of the tree.
