| tags | date | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
|
2025-09-26 |
👉 Key difference from linear structures
- Linear → one-to-one relation (next element only).
- Non-linear → one-to-many relation (branching, multiple paths).
- Binary Tree
- BST → Binary Search Tree
- BST → AVL Tree / self-balancing
- B-Tree (used in Databases)
- B+ Tree (optimized for range queries in DBs)
- Heap
- Max Heap
- Min Heap
- Trie (Prefix Tree | Digital tree) → wikipedia Trie
- Segment Tree
- Fenwick Tree (Binary Indexed Tree)
- Directed Graph (Digraph)
- Undirected Graph
- Weighted Graph
- Unweighted Graph
- Cyclic / Acyclic Graph
- Directed Acyclic Graph (DAG)
- Adjacency Matrix / Adjacency List (common representations)