Data_Structures_Theory_Notes
Data_Structures_Theory_Notes
2. Recurrence Relation
Used in recursive algorithms to find time. Example: T(n) = 2T(n/2) + n
1. Arrays: Fixed size, direct indexing. Fast access but resizing is hard.
3. Stack (LIFO): Last in, first out. Used in function calls, undo.
Unit 3: Recursion
UNIT 3: Recursion
Traversals:
- Inorder (Left, Node, Right)
- Preorder (Node, Left, Right)
- Postorder (Left, Right, Node)
1. BST: Left child < root < right child. Fast insert, search, delete.