236. Lowest Common Ancestor of a Binary Tree | EPIC Tree Series | leetcode | DSA

[@prashantchaudhary8147]

Your way of explaining things is very smooth. Keep going.

[@sandeepnaikat5598]

great work thanks , most of the topics learning from u only 😊😊😊

[@nownow1025]

Best explanation bro saw 2-3 videos of same but yours top-notch😘

[@RohitKumar-dz8dh]

Thanks 😊

[@surajgaur4770]

Very deep understanding and cleared recursive approach.

[@ShivamMaurya-ee4zp]

Best explanation on youtube ❤

[@mr.nishantawasthi4402]

Nice explain sir ❤

[@ABsStudio-s1u]

Keep Going

[@susmoy4385]

Vaiya notes update kardo .. bohot Sara lecture ka notes Nehi hain .. notes or codes ko agar update kar dete to bohot accha hota

[@subratamandal2924]

Intuition ekdam bakwas. Sirf process bol diya aur usko samjhaya kyun aur kaha se wo process aya ku6 nhi bola. Last mein code ke baqt main bhi jyada nhi samjhaya..ho sakta hai mujhe samajh nhi aata Per explanation a66a nhi laga. 4 bar dekha phir bhi nhi. Aap improve kar sakte ho Thanks

[@i_do_what_i_like]

Maybe this will help you. I assume you understand the definition of LCA. To find it Shashwat said LCA would be the first common node we will get when we move upwards from the bottom (bottom up). Here we traverse the tree in pre-order (a type of DFS). In pre-order we process the current node, then go towards left and then go towards right. When our pointer is on any of the target node we return the address to its parent. If we reach the end of tree without finding one of target nodes, we return null. Now when recursion will unfold itself, the parent which will have two non null values will be our answer because it will the first common node to the two target nodes.