0% found this document useful (0 votes)
7 views2 pages

Data Structures Extended

Uploaded by

Tuấn Khang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views2 pages

Data Structures Extended

Uploaded by

Tuấn Khang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structures Cheat Sheet (Extended)

Data Structures Cheat Sheet

Linear Data Structures:

1. Arrays: Fixed-size sequential collections, suitable for index-based access.

2. Linked Lists: Dynamic collections with nodes connected by pointers.

3. Stacks: LIFO structure for operations like backtracking or undo functionality.

4. Queues: FIFO structure for task scheduling and buffering.

Non-Linear Data Structures:

5. Trees: Hierarchical structures used in databases and file systems.

6. Graphs: Used to model networks, with nodes (vertices) and edges (connections).

7. Heaps: Complete binary trees used in priority queues.

Common Operations:

8. Searching: Techniques like binary search for sorted data.

9. Sorting: Algorithms like QuickSort, MergeSort, and BubbleSort.

10. Traversal: Breadth-first search (BFS) and depth-first search (DFS) for trees and graphs.

Applications:

11. Hash Tables: Efficient data retrieval using hash functions.

12. Tries: Efficiently store and search strings, used in autocomplete systems.
13. Disjoint Set Union (DSU): Used in graph algorithms for finding connected components.

You might also like