Correction: as pointed out in a comment below, the correct answer at 7:02 in the video is 8n - 3.
When learning to perform algorithmic analysis, it is common to see algorithms that use a divide-and-conquer approach. These lead to divide-and-conquer recurrence relations. In this video I solve one of the recurrences from my last video, but I use the Recursion Tree Method this time.
