Largest BST in a Binary Tree | BST | Love Babbar DSA Sheet | Amazon🔥

[@CodeLibrary]

UPDATE Node with value 12 will not make BST because it's not satisfying the BST condition by mistake I told that it's making BST... but in next part of intuition I have explained the correct things

[@tech-rhino4469]

Bhai ye comment dekhne se pehle me soch raha tha bande ne kaunsa maal phook lia hai

[@DurgaShiva7574]

bahut badiya padhate ho aap, behtareen

[@zeenatfirdoshquadri8259]

explanation much clearer than top tutors

[@rawat_ji5183]

true

[@rawat_ji5183]

perfect explanation sir 😁😁

[@ankitdubey9310]

kafi bawal solution!!

[@ajitkumar4-yearb.tech.civi191]

Thanks Bhaiya....ur videos are very helpful 😊

[@CodeLibrary]

Always welcome

[@parasagarwal3368]

Thanks. Great Explanation bhai.

[@harshalgarg1149]

Your videos are really helpful. 👌

[@altafmazhar7762]

Great Brother

[@shaanbansal7775]

thank you vro and you are a excellent teacher

[@dhruv2014]

Fantastic code and explanation 🔥🔥🔥

[@rimpiranibaruah5353]

Excellent explanation

[@tanyagupta0201]

OP 🔥

[@vishadjain2696]

Nice explanation....

[@abhishekchakrabarty2930]

Very much helpful

[@kumarivandana1554]

Nice explanation

[@ashishchaturvedi1301]

Thanks Man... great video... but line number 129 is not required.

[@surajpatil3247]

bro ! x aur y me left ka min aur right ka max kyo liya? hume to left ka max aur right ka min chahiye na ????

[@suryanshsingh6906]

Op bhai

[@gauravjaiswal7407]

very nice!!

[@helloUser12373]

Bro, 4:58 12 root wala bst nahi banayega, bcoz 12>9 and 12>10.

[@AnandKumar-uy7nn]

Just a little trimmed code !! vector solve(Node* root){ if(root == NULL) return {1,0,INT_MAX,INT_MIN}; auto l = solve(root->left); auto r = solve(root->right); if(l[0] and r[0]){ if(root->data > l[3] and root->data < r[2]){ int x = l[2]; // min int y = r[3]; // max x = min(x,root->data); y = max(y,root->data); return {1,l[1]+r[1]+1,x,y}; } } return {0,max(l[1],r[1]),0,0}; }

[@sudheer4866]

There is no need to put the second line in the solve function as (!root) this line return statement will make sure all the code is correct

[@akashjain3254]

Nice explaination bhai 👌👌👌

[@CodeLibrary]

Thanks

[@FaisalKhan-oy4zz]

🔥

[@nishantmittal1506]

code sahi chl gya?? mera WA de raha hai

[@ankitdubey9310]

same bro, infact mere mein segfault aa raha hai

[@ghazanferwahab5673]

@@ankitdubey9310 if(y==MIN_VALUE) hoga,dono mein max leliya hai

[@chanduchandrakanth5131]

Bro next topic is stack and queues

[@CodeLibrary]

Okay

[@tekbssync5727]

3:54 wait what? galat bol rha hai bhai ... 😂

[@CodeLibrary]

Yaa node with 12 will not make BST by mistake I told that it will make BST... But age intuition sahi diya hu

[@zyro9922]

Best explanation

[@bholeKBhakt]

Discord link ?

[@tusharkumar9511]

bhai tree aur linked list ki playlist fadddu h

[@CodeLibrary]

Thanks 😀

[@gauravkumarsaini9082]

banda nhi hai, element hai bhai....

[@25694448]

Can you please provide the Java Code for this problem

[@Surajrawat-xx1gw]

bro how can i get this excel sheet

[@CodeLibrary]

It's given in description

[@pranjaljain7331]

12 wala bst nahi banega because 12>9 and 12>10

[@tekbssync5727]

exactly

[@sainisaab684]

flow flow me feel le gya bhaii :)

[@srishtiporwal2938]

My 16th test case is failing

[@namanftw8641]

opppp

[@ramswrooppatidar7599]

abe daru pee ke vedio bante ho kya beee , 12 ke right me dono chhote hai ,

[@CSBPRINCE_KUMAR]

Nice explanation