LeetCode 236. Lowest Common Ancestor of a Binary Tree | Medium | Algorithm Explain | C++

preview_player
Показать описание
When you see a target node .... just return it. At any node see what leftLCA and rightLCA it is receiving. Take your decisions wisely.

1 Like= motivation x 100
1 Subscribe = motivation x 100000 !!!

Thanks for watching friends.

Please like and share with your friends it will give me motivation to make further videos.
Connect with me at
Рекомендации по теме
Комментарии
Автор

Thanks sir for the explanation and easy code !

cppxaxa
welcome to shbcf.ru