DSA Python Notes (Fixed Download Version)
Data Structures & Algorithms in Python: 1. Time Complexity: O(1), O(n), O(log n), O(n^2) 2. Arrays
(Lists): append, insert, delete 3. Stack: LIFO (push, pop) 4. Queue: FIFO (deque) 5. Linked List:
nodes connected by pointers 6. Searching: Linear (O(n)), Binary (O(log n)) 7. Sorting: Bubble,
Merge, Quick Sort 8. Trees: Binary Tree, BST, traversals 9. Graphs: BFS, DFS