TSV
Data Structures - TSV
Data structures are methodologies for efficiently storing and managing data in computer memory. They are broadly classified into linear data structures (arrays, linked lists, stacks, queues) and non-linear data structures (trees, graphs, hash tables), each with different time and space complexity characteristics for specific operations. Choosing the appropriate data structure significantly impacts algorithm efficiency and program performance.
data structures
computer science
algorithms
programming
memory management
code slug name description category type
01 array Array A data structure storing elements of the same data type in contiguous memory locations. Linear Data Structure Static
02 linked-list Linked List A data structure storing data in non-contiguous memory locations through nodes connected by pointers. Linear Data Structure Dynamic
03 stack Stack A data structure that manages elements based on the Last In First Out (LIFO) principle. Linear Data Structure Dynamic
04 queue Queue A data structure that manages elements based on the First In First Out (FIFO) principle. Linear Data Structure Dynamic
05 tree Tree A non-linear data structure consisting of nodes with hierarchical relationships. Non-linear Data Structure Dynamic
06 graph Graph A non-linear data structure with a network structure consisting of vertices (nodes) and edges. Non-linear Data Structure Dynamic
07 hash-table Hash Table A data structure that stores key-value pairs using a hash function. Non-linear Data Structure Dynamic
08 heap Heap A data structure based on a complete binary tree with ordering between parent and child nodes. Non-linear Data Structure Dynamic