Scribd
Upload
4 views1 page

DSA Notes

The document provides quick notes on data structures and algorithms, covering basics, stacks, queues, linked lists, searching and sorting techniques, trees, and graphs. Key operations and their time complexities are outlined, including O(1) for stack and queue operations, O(log n) for binary search, and O(n log n) for efficient sorting algorithms. It also highlights the performance of various tree structures and graph traversal methods.

Uploaded by

aryanrk4532
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
4 views1 page

DSA Notes

The document provides quick notes on data structures and algorithms, covering basics, stacks, queues, linked lists, searching and sorting techniques, trees, and graphs. Key operations and their time complexities are outlined, including O(1) for stack and queue operations, O(log n) for binary search, and O(n log n) for efficient sorting algorithms. It also highlights the performance of various tree structures and graph traversal methods.

Uploaded by

aryanrk4532
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

DATA STRUCTURES & ALGORITHMS - QUICK NOTES

Unit 1: Basics
Data, Data Structures, Algorithms, Operations (Insert, Delete, Traverse, Search), Asymptotic
Notations O, Θ, Ω.

Unit 2: Stack & Queue


Stack (LIFO): Push, Pop O(1). Queue (FIFO): Enqueue, Dequeue O(1). Priority Queue: O(log n).

Unit 3: Linked List


Singly, Doubly, Circular. Traversal O(n), Insert/Delete O(1) (if position known).

Unit 4: Searching & Sorting


Linear Search O(n), Binary Search O(log n). Sorting: Bubble, Selection, Insertion O(n²),
Merge/Quick/Heap O(n log n).

Unit 5: Trees
BST: O(log n) avg, O(n) worst. AVL: O(log n). B-Tree: O(log n), multi-level balanced.

Unit 6: Graph
BFS, DFS O(V+E). Dijkstra: O(V²) or O((V+E) log V).

You might also like