Find Kth Ancestor Of The given Node In Binary Tree

[@yashpratapsingh2485]

Best solution till now present on youtube

[@CppNuts]

Thanks

[@shivkant941]

Good Solution...

[@anujmishra778]

very nice and , very clear explanation sir thank you

[@CppNuts]

Thanks and welcome

[@NaveensinglaYT]

Correction I think we are not the value 7 actually we are returning the Node which contains value 7 i Know for some this might be same thing but for beginners it can get a little bit confusing

[@gauravmane5282]

Nice Explanation 😊

[@CppNuts]

Glad you liked it

[@prateekshrivastava2802]

thanks!!!!!

[@abhisheksrivastava3699]

Got confused returning root at line 26 will work I was in an impression it may give false alarm to parent cl that we found the target

[@subendu4u]

Well, we are not avoiding recursion when the node is found isnt it?
For example: getKthAncestor( root, 7, 1); will still undergo recursion for 2->right because 4 is returning NULL to 2, right?

[@subendu4u]

I think removing the "return NULL;" when "k==0" should do the trick?

[@ramakrishna4092]

Hi cpp nuts
Is there any other way to become a patreon because my card was disabled for international transactions if you have any other way pls tell me I have also contacted my bank 🏦 they need more than a month .

[@CppNuts]

Thanks for the consideration, but no man i don't know any other way..

[@ramakrishna4092]

@@CppNuts ok sir thanks