Advanced tree data structures — each now has its own detailed page with implementations, Mermaid diagrams, and practice problems.

---

Each special tree is now explained in depth on its own page:

Tree	Dedicated Page	Key Operation	Time	Use Case
Trie	Trie (Prefix Tree) →	Search string	O(L)	Autocomplete, spell check
Heap	Priority Queue & Heap →	Get min/max	O(1) peek	Priority queue, Dijkstra
Segment Tree	Segment Tree →	Range query	O(log N)	Range sums, min, max
Fenwick Tree	Fenwick Tree (BIT) →	Prefix sum	O(log N)	Range sums, counting
AVL Tree	AVL Tree →	Self-balancing	O(log N)	Balanced BST
Red-Black Tree	Red-Black Tree →	Self-balancing	O(log N)	TreeMap, std::map

---

Tree	Structure	Key Operation	Time	Use Case
Trie	N-ary tree per char	Search string	O(L)	Autocomplete
Heap	Complete binary tree	Get min/max	O(1) peek	Priority queue
Segment Tree	Binary tree on ranges	Range query	O(log N)	Range sums/min
Fenwick Tree	Binary indexed	Prefix sum	O(log N)	Prefix sums
AVL Tree	Self-balancing BST	Search / Insert	O(log N)	Balanced BST
Red-Black	Self-balancing BST	Search / Insert	O(log N)	TreeMap, std::map

---

• Heap Operations — Insert, Delete, Heapify
• Types of Trees — Standard tree types
• Tree Traversals — DFS & BFS