Lecture 70: Binary SearchTree FAANG Interview Questions || Part-1

In this Video, we are going to solve Questions related to BST.

There is a lot to learn, Keep in mind “ Mnn bhot karega k chor yrr apne se nahi hoga ya maza nahi aara, Just ask 1 question “ Why I started ? “

Questions Links:

Do provide you feedback in the comments, we are going to make it best collectively.

Connect with me here:

Telegram Group Link: Love Babbar CODE HELP

Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

Timestamps:

00:00 - Question 1
02:11 - Approach #1
03:27 - Promotion
04:19 - Approach #2
06:06 - Code
10:23 - Question 2
11:00 - Approach
12:53 - Code
16:35 - Question 3
17:30 - Question 4
18:20 - Approach #1
19:40 - Approach #2
21:44 - Code
28:15 - Question 5
30:30 - Approach
32:50 - Code

#DSABusted #LoveBabbar

[MohitKumar-ysjd]

The way you always teach more than 1 approach to a question just shows how dedicated you are!! Thanks a lot, bhaiya!!

[fahadalam]

I only want dedication and persistence like this man in my life.

[RajKumar-vqnm]

Maza agaye sare question solve kar ke ....Thanks from bottom of the heart...Kuchh log hote hai jo har field me bawal macha dete hai aap unhi me se ho.

[harshitsharma]

Boht bdhiya explanation sir ji, I just came here because of the notification to see kya upload kiya bhaiya ne lekin I don't know how and where 40 minutes went away, and I understand the concepts with ease and clearly.Thankyou so much Babbar saab ❤️
#LoveBabbarisLove

[prashantbirajdar]

wahh bhaiyaa another fabulous session you are great bhiyaa means, har ek video itna jyada excitement rehta hai ap itna jyada mehnat krte hoo....humare liye...aur sabse unique cheez jo apka passion hai passion agar nhi hota toh itna lamba koi nhi aa sakta tha toh hatts off to u bhiyaa sub kuch samaj aya iss session me se..thanks bhiya love you....*3000 times

[shantanu]

In checking of validation of BST, we cam also use, that in a particular node the max value from left subtree will be lesser than root->val and the min value of right subtree will be greater than root->val. basically backtracking. T.C> 0(N) and s.c>> 0(H);

[iutkarshmehta]

Attendence marked👍
Consistency is back big bro❤️

[rutujachougule]

Thank you so much sir. ❤️🙏Consistency🔥🤩

[The_Shubham_Soni]

10:26, Q2: Kth smallest element in BST:

void inorderTraversal(Node* root, vector<int> &ans)
{
if(root==NULL)
{
return;
}

inorderTraversal(root->left, ans);
ans.push_back(root->data);
inorderTraversal(root->right, ans);
}

// Return the Kth smallest element in the given BST
int KthSmallestElement(Node *root, int K) {
// add code here.

vector<int> ans;
inorderTraversal(root, ans);

if(ans.size()<K)
{
return -1;
}

return ans[K-1];
}

[__divyanshusrivastava]

In leetcode, use LONG in place of INT, and don't include "=".

[govindsuryavanshi]

First I have completed all DSA series and now conclude this is Greatest ever DSA series to exist on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇‍♂ Thanks you.

[subhasishasahoo.]

Bro maza aagaya ... Supp. Audio Quality.. We all are adjust it because your quality of teaching is OP level... Samajh++++

[venkateshpk]

your explanation and its optimized approach explanation are just awesome

[alankritaagrawal]

Present bhaiya ✨ consistency+ quality= babbar bhaiya

[manishvijay]

Awesome content ab feel AA rhi h bhaiya fod denge 🔥🔥🔥

[AbhishekChoudharyB]

*validate the bst was actually a good question*

[unboxtheuniverse]

Thanks you bhaiya 🙌🙌 70 episode 170 times thankyou bola he par fir bhi kam lag rha 😅🙌🙌 thankyou for this Amazing course

[AmanKumar-ecbz]

Thanks sir aapke hi wajah se daily mai consistent practice coding kr rha hu❤️👍

[_SahilShah]

Marked my Attendance & Thank You So Much Bhaiya!
Commenting for better Reach!💫

[sunielsharma]

Sir mere ko heart ❤️ chahiye nahi to mai nahi padhunga 😁😁Lots of love sir from Nepal ...