Chapter Name: Solved Problems of Solving Recurrences & Recursion in Programming Please visit: gate.appliedro... For any queries you can either drop a mail to Gatecse@appliedroots.com or call us at +91 844-844-0102
@@GATEAppliedCourse in the last, it should be 2^(n-2) *c Because when in the leftmost node, n-1 c n-2 2^(2-1) *c n-3 2^(3-1) *c .... .... n-(n-1) 2^(n-1-1) or we can say that 1 2^(n-2)
@@AbhishekGupta-vs4du @GATE Applied Course in the last, it should be 2^(n-2) *c Because when in the leftmost node, n-1 c n-2 2^(2-1) *c n-3 2^(3-1) *c .... .... n-(n-1) 2^(n-1-1) or we can say that 1 2^(n-2)
