Introduction to Data Structures

Types

Implicit Data Structure

In computer science, a implicit data structure or space-efficient data structure is a data structure that stores very little information other than the main or required data: a data structure that requires low overhead. They are called "implicit" because the position of the elements carries meaning and relationship between elements.

Formally, an implicit data structure is one with constantO(1)space overhead

Explicit data structure

Succinct data structure

A succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound, but (unlike other compressed representations) still allows for efficient query operations.

https://en.wikipedia.org/wiki/Succinct_data_structure

Linear Data Structure (they all have a logical start and a logical end)

1. Array
2. Linked List
   • Doubly Linked List
   • Circular Linked List
3. Stack
4. Queue
   • Queue FIFO
   • Dequeue
   • Randomized Queue
   • Priority Queue (Using array)

Hierarchical Data Structure

1. Tree(Ex - Family tree, HTML DOM)
   • Binary Tree
   • Binary Search Tree
   • AVL Tree
   • 2-3 Tree
   • Red Black Tree
2. Trie
3. Heap
   • Binary Heap
   • Fibonacci Heap
4. Hash Map
5. Graph
   • Undirected graph
   • Directed graph
6. Rope (Efficient for String concatenation)

https://www.wisdomjobs.com/e-university/data-structures-tutorial-290.html

https://medium.freecodecamp.org/all-you-need-to-know-about-tree-data-structures-bceacb85490c

https://www.freecodecamp.org/news/learn-all-about-data-structures-used-in-computer-science