Solve Recurrence using Recursion Tree Method Example1

Solve the recurrence T(n) = 2T(n/2) +1 using Recursion Tree method.

[@zarahassan6058]

Well Described.
Huge Respect Sir🤩

[@sardarzain1066]

What a explanation

[@basithvpbasith2461]

Super class sir. Thank you 💞💞

[@md.alamintalukder3261]

thanks a lot

[@snehas7065]

🎉

[@muhammedmuhsink5062]

Good class thank you✌✌

[@kamayaesp0651]

What if n is an odd number?

[@praveengl621]

If n is odd the problem will get divided in to subproblems of size ⌊ n/2⌋ and ⌊ n/2⌋ + 1 respectively. But we can clearly conclude that problem size will be atmost ⌈n/2⌉.