I was solving recurrence relations. The first recurrence relation was $T(n)=2T(n/2)+n$ The solution of this one can be found by Master Theorem or the recurrence tree method. The recurrence tree
Recursion Tree, Solving Recurrence Relations
Time Complexity
Solved Part 1 Q.1: Solve the following recurrence relations
How to solve time complexity Recurrence Relations using Recursion Tree method? - GeeksforGeeks
Lecture 20: Recursion Trees and the Master Method
Recurrence — cse102-notes documentation
Solved Part 1 Q.1: Solve the following recurrence relations
Recursion Tree, Solving Recurrence Relations
8/2/20151 Analysis of Algorithms Lecture: Solving recurrence by recursion-tree method. - ppt download
Recursion Tree Method - Scaler Topics
4.4 The recursion-tree method for solving recurrences - Introduction to Algorithms
How to resolve recurrence t(n) =2t(n/2) +n/logn - Quora
DAA Recursion Tree Method - javatpoint