2.15 Recursive Tree Method for Solving Recurrences | Recurrence Relation | Example-1 | Algorithm

In this video, I have discussed how to solve a recurrence relation using a recursive tree method with the help of an example.
Previous video link: • Video
I have created this free of cost TH-cam channel for computer science and information technology students. Through this channel, I have tried to explain some important topics in a simple way. This channel is very helpful for computer science engineering students who may be from GATE, NET, M.TECH, B.Tech, BCA, BSC, MCA, MSC etc. In this channel, I am trying to cover previous years solved GATE questions, Data Structures, Algorithm Design, Operating System, Data Base Management System(DBMS), Theory of computation (TOC), compiler design, C programming etc.
Below are the links to my playlists:
1. Operating System: • Operating System by Na...
2. Data Structures: • Data Structures by Nar...
3. Motivational Videos: • Motivational Videos by...
4.. Algorithm: • Algorithm Design by Na...
5. Theory of Computation: • Theory of Computation ...
6. Compiler Design: • Compiler Design by Nar...
7. GATE previous year solutions: • GATE Previous Year Com...
My Channel URL:
/ nargishgupta
My Website URL:
www.nargishgupta.com
#recursivetreemethod
#algorithmanalysis
#algorithm

[@amanmalviya5993]

Best video to learn recursive tree method on TH-cam ,thank you sir🔥

[@prabhisheksingh1988]

Agree

[@prachikumari5741]

Best video I found to solve recursion tree method.... I was struggling a lot in this topic thankyou 🙏

[@hoop5768]

Thank u soo much...best video...helped me just 10 mins before the test

[@sandy1yadav]

Watch so many videos but this one is best one video thanks

[@sayantandas5375]

very very thank you you saved me in this topic

[@abhishekjaiswal6492]

great explanation sir , very useful video

[@manisaxena2066]

Nice way of teaching sir bahut bada doubt solve ker diya aap ne

[@anshibajaj9738]

Best video as well as best channel

[@premlatakumari9250]

Very easy to understand this method after watching this videos

[@pankajgupta1170]

Thank you so much sir, very easy

[@mibranhassan5586]

Bhaiya best video sary concepts clear ❤️

[@vinayakpandey7180]

Underrated 🔥🔥

[@rajatjain9275]

Nice way of teaching sor.very easy you deserve more videos...

[@anonymoussaiyan7555]

Superb Explanation

[@nancysaxena3670]

Awesome teaching

[@sunainasaxena5986]

Nice way of teaching

[@ikshitgupta176]

nice way of teaching..

[@bhupendrsen3815]

Bahut videos me number one

[@codewithwaqas5862]

Thank you sir you are best

[@SahilKhan-zn9px]

Thank you sir.

[@shikharchaurasia1384]

you are great

[@thegreekgoat98]

most underrated channel

[@RahulDubey-ov2fd]

thanks for this video. before watching this video i left this topic for GATE exam. thank you so much

[@creativeartandcraftwithson9497]

very easy sir ji..keep it up

[@mayabajaj2163]

Well explained sir

[@paropriya3525]

Sir bahut acha 10m jaldi hojay ye kamna karta hu..

[@neerusaxena5644]

Precisely explained thank u sir...

[@niteshgupta258]

After watching so many videos this is best I ever seen.thank you

[@mafleshgupta20]

Easy thank you sir

[@alamzebkhan317]

Sir Bundles of Thanksssss

[@bajajpriyanshu8235]

Best one

[@santoshgupta-ey2qq]

Thanks

[@gopalchaudhary6170]

Superb

[@AnkitGupta-nt7cd]

Biradar Bhai 😇

[@sanjugupta60]

best video

[@priyeshjhawar3257]

Nice video sir

[@falaksajjad4910]

😍

[@anshusaxena6072]

👌👌👌

[@dream_pcs_factory6352]

💓

[@milisaxena4930]

Nice

[@rajkumargour8875]

Nice sir

[@vaishnavisaxena557]

Aap Accha padhte ho

[@profamitrathore8711]

nice

[@amantyagi6057]

Agar n recursive function mai na ho koi constant ho 1

[@arunchaurasiya2053]

Sir B - tree and 2-3 tree answers ki video upload kijiye exam mai aana hai

[@ngtutorials]

Already uploaded on channel

[@keshavupadhyay3146]

Recursion tree kya hn fir

[@hoop5768]

Plz tell ki log n = k log 2 kyu Nahi huaa

[@ngtutorials]

Because of we are calculating the height of each level and in this question the total height is n*k= nlogn. Because the k value is long

[@technicalspider2547]

@@ngtutorials u don't know?

[@zinneerawaheed3840]

k=log base (2) n nai aae ga?

[@ngtutorials]

By default the base is 2.

[@zinneerawaheed3840]

Thanks

[@parastewari5697]

t(n)= theta (n log n) ------ kese aaya?

[@sahilchavan6592]

see previous videos

[@javokhirbekradjabov9545]

Ummm, is this english or indian language?

[@bhavkeeratsingh4986]

This is hindi-one of India's language

[@mrcomment2812]

Dude, is this supposed to be english!?

[@vikashkumar-kn2ck]

if tree is not balanced then can we say that the Left subtree Height multiplied by each level cost will give BEST CASE Time complexity????
plz reply.
if tree is not balanced then can we say that the Right subtree Height multiplied by each level cost will give WORST CASE Time complexity????
plz reply.
AND HOW TO FIND AVERAGE CASE COMPLEXITY USING THIS METHOD?

[@ngtutorials]

This case is applicable only when the running time of each level is the same then we can multiply with height.

[@hoop5768]

Thank u soo much...best video...helped me just 10 mins before the test