This repository contains multiple assignments focused on backtracking algorithms and advanced data structures.
The projects include implementations of:
- AVL Trees
- B-Trees
- Backtracking (undo) operations
- Redo operations
- Order-statistics operations
- Dynamic Set ADTs
Implemented:
- backtracking search algorithms
- dynamic sets using:
- unsorted arrays
- sorted arrays
- binary search trees
- undo/redo operations using stacks
Topics:
- backtracking
- stacks
- dynamic sets
- complexity analysis
Implemented:
- backtracking for AVL Trees
- backtracking for B-Trees
- Select(i) operation
- Rank(val) operation
Topics:
- AVL Trees
- B-Trees
- order statistics
- balanced trees
- efficient undo mechanisms
- Java
- Data Structures
- Algorithms
- Backtracking
- Complexity Analysis
- Balanced Trees