L53. Largest BST in Binary Tree

preview_player
Показать описание


#treeSeries #striver #placements
Рекомендации по теме
Комментарии
Автор

This is the last video of this series. I hope you enjoyed this. Just a small request:

“Please share the series, also you can tag me at Linkedin if you want a give a review for this series, this will do me a world of good”

Thankyou 🙏🏻

takeUforward
Автор

Completed the entire FREE KA TREE series! Learnt a lot! Thank you Striver for putting up such quality content!

arpanbanejee
Автор

11:27 Minimal will be 30 and not 40 !! Thank you striver for this series!! Helped me alot !!

bhargav
Автор

CONGRATS to everyone else who successfully completed this playlist!

subodh.r
Автор

Completed the Tree series in 10 days.
Thank you STRIVER for making such a quality content .

PrinceTripathi-ju
Автор

Correction : At 11:30, the minimum for subtree with root=40 is 30 not 40 . Please provide an edit at this juncture

sujoyseal
Автор

9:37, at root =14, he wrote [size, max, min] and at root=18, he wrote [size, min, max] so dont confuse he suffle the order take order [size, max, min] max come form right size and min come for left size for creating a [size, max, min]

DivyamPadole
Автор

Just completed this playlist and I would highly recommend it to anyone wanting to learn how to solve Binary Tree and Binary Search Tree based problems from scratch. Thank you for this valuable content !! Cheers ✌❤

aaqilkrishna
Автор

finally completed this amazing free ka tree series and now im taking a break then soon i'll start the next your graph series
thanks alot striver for amazing explanation, efficient code, time complexity an all.thank you so much

abdulrazzak
Автор

Completed the entire series today. Feeling much more confident now. Thank you very much Stiver! 😃

taranjotsingh
Автор

The hardest tree question I came across but thanks to you, now it's completely clear!!

AkashDeep-jpts
Автор

Today I have completed the Free Ka Tree series playlist .It took almost 21 days to complete this series from start to end .I really enjoyed the playlist and learn many new ways of solving tree questions ...thanku striver bhaiya for this top quality content always be thankful to you❤️❤️

shobhitshrivastav
Автор

completed the entire tree series. Enjoyed a lot! thank you for all the content striver!

Dontpushyour_luck
Автор

**important** if someone is confused while doing dry runwith the solution and example then consider this, There is issue in naming of variables in the code, even though things work well. The maxNode should be replaced by minNode and vice-versa.

Tahirkhan-hvjn
Автор

completed this series today! THANKYOU STRIVER for making such a quality content . Really helped a lot . It took me 6 days to complete this series . It was worth it.

vaishnavigour
Автор

Earlier trees and graphs haunt me. Completed this playlist and now questions are solvable. Thank you striver.

captcha
Автор

A great series to learn tree from scratch. Thanks for top notch content. It was really very helpful.

aadityakhetan
Автор

completed whole playlist today, thank striver

noone-pnyu
Автор

Just completed your amazing tree series Striver and thanks for making such a wonderful series for free :)

_CSE_PRATHISWARANGR
Автор

Done with free ka tree series. A big thank you striver, I taught i knew trees very well, But when i watched these videos, I had not known most of it.

iamnoob