~/home ~/about ~/projects ~/blog ~/tracker ~/uses ~/contact

~/home ~/about ~/projects ~/blog ~/tracker ~/uses ~/contact

DSA Tracker

0%

Apr 07 → Jul 20, 2026 on track

Wk 1 · Basics & Foundations Wk 2 · Strings & Advanced Fou

Wk 3 · Linked Lists - Basics Wk 4 · Queues & Binary Trees Wk 5 · Binary Trees Advanced

Wk 6 · Heaps & Graphs Basics Wk 7 · Graph Algorithms & Tri Wk 8 · Union-Find & Phase 3 R

Wk 9 · Dynamic Programming Ba Wk 10 · Dynamic Programming A Wk 11 · Backtracking & Phase

Wk 12 · Timed Sessions & Prac Wk 13 · Practice Rounds 2 & 3 Wk 14 · Final Consolidation &

Wk 15 · Arrays & Hash Maps Wk 16 · Linked Lists & Trees

Wk 17 · Graphs & Dynamic Prog Wk 18 · Backtracking & Final

Week 5: Binary Trees Advanced & BST

May 5-11 | Phase 2: Core Structures

Day 1-3: Binary Trees - Advanced

3-4 hours

📚 Learning

Lowest common ancestor
Maximum path sum
Tree diameter
Serialize/deserialize

🔗 LeetCode

236. Lowest Common Ancestor of Binary Tree Medium
124. Binary Tree Maximum Path Sum Hard
297. Serialize and Deserialize Binary Tree Hard

📝 Reflection / Notes:

Day 4-5: Binary Search Trees

2-3 hours

📚 Learning

BST properties and validation
Search, insert, delete
In-order gives sorted sequence

🔗 LeetCode

98. Validate Binary Search Tree Medium
230. Kth Smallest Element in BST Medium
235. Lowest Common Ancestor of BST Easy

📝 Reflection / Notes:

Day 6-7: Phase 2 Wrap-up & Review

2-3 hours

📚 Learning

Revisit all tree problems
Practice linked list problems

🔄 Review

Reverse Linked List
Valid Parentheses
Binary Tree Inorder Traversal
Validate Binary Search Tree

📝 Reflection / Notes: