Every recurrence T(n) = aT(n/b) + f(n) is a blueprint for a tree. Build it, weigh it level by level, and watch the Master Theorem verdict fall out of real numbers — not memorised rules.
Recurrence Controls
🔨 Foreman RecurSliders in hand, boss? Drag 'a' and I'll pour another set of branches at every level.
🧮 AdderAnd I'll be right here with my ledger, tallying exactly how much work lands on each floor of this tower.