make recurrence tree for 2T(n/4) + O(nlogn)
Process for creating 2 level tree
recursion tree upto k+1 levels
if no stopping condition given this tree can go upto infinite level as k+1 will go to infinity
If you are having any doubts please ask i will answer asap
Get Answers For Free
Most questions answered within 1 hours.