Maximum Sum BST in a Binary Tree | LeetCode Solution | Algorithm Explanation by alGOds!!

preview_player
Показать описание
In this video, V Sriram has explained the optimized approach for solving the question #MaximumSumBSTInABinaryTree from #LeetCode in O(n) time complexity.

Feel free to ask any of your doubts and discuss your attempts related to this question in the comments section 😇.

Do like and subscribe to our channel and click the bell icon so you don’t miss any future videos!!.
Don’t forget to tell us about the Questions you need an explanatory video for in the comments section. We’ll definitely take care of it😁.

The contributors to this channel and their profile links are enlisted below

1) Vishesh Aggarwal:
2) Vaibhav Varshney:
3) Vagish Yagnik:
4) Vishesh Jain:
5) Achint Dawra:
6) V Sriram:
7) Varun Bajlotra:
8) Vikas Yadav:
Рекомендации по теме
Комментарии
Автор

Good job man. The explanation was easy to understand. 😄

marvellouschandan
Автор

p.minv = min(root->val, l.minv);
p.maxv = max(root->val, r.maxv);
plz explain these lines..

divanshmahajan
Автор

Hey, where are you guys nowadays? Long time no see...?

Prashantkumar-pnqq
join shbcf.ru