Data Structure
A Data Structure is a specialized format for organizing, processing, retrieving, and storing data.
Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Common examples include arrays, linked lists, stacks, queues, trees, and graphs.
graph LR
Center["Data Structure"]:::main
Rel_tree["tree"]:::related -.-> Center
click Rel_tree "/terms/tree"
Rel_data_type["data-type"]:::related -.-> Center
click Rel_data_type "/terms/data-type"
Rel_merkle_patricia_trie["merkle-patricia-trie"]:::related -.-> Center
click Rel_merkle_patricia_trie "/terms/merkle-patricia-trie"
classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
linkStyle default stroke:#4b5563,stroke-width:2px;
🧠 Knowledge Check
🧒 Explain Like I'm 5
A graph is like a map of subway stations. Each station is a 'node', and the tracks between them are 'edges'. You can use graphs to figure out the best way to get from one station to another or to see which stations are the most connected.
🤓 Expert Deep Dive
Graphs are represented in memory using Adjacency Matrices (O(1) edge check) or Adjacency Lists (O(degree) space efficient). Key algorithms include Dijkstra's for shortest paths, PageRank for node importance, and Tarjan's for strongly connected components.