Thanx aman bhaiya , I know lot of people are not valuing your effort of free education,but please countinue this for students like us who need these free education. ❤️❤️
rajpal yadav commenting 😆😆😆 bhai notes me bas code rehta hai to aisa kar video dekh kar ek baar practice to karta he hai na to vo code ek aisi file ke naam se save kar ki vo notes ka kaam karein vs code me. bas ho gaya tera kaam.
omg I've been trying to understand for several days bt this is the first video I understood clearly. thank you so much. This is my first video on your channel, and certainly i'm subscribing. keep up the good work. thank you
And guys if u make notes by yourself u will learn a lot, remember when u were preparing for any exams you were able to understand easily with you notes than others
My code is not running. I have a doubt. When calling the insertBST function for the values other than the first one,the function returns a node pointer value but we do not store it in any variable. Will this not be incorrect?
thats actually because the insertBST function has inside it commands to do changes in the root node, so calling them makes changes in the root node itself. so we just have to assign the initial node to get the entire BST
@@zainulkhan8381 bro, i think the return root is useful for getting root's position in main() function. Just see the first two lines in main function i.e., root = insertBST(root, 5)
No void buildTree(node *curr, int v) { if (v > curr->data) { if (curr->right == NULL) curr->right = new node(v); else buildTree(curr->right, v); } else { if (curr->left == NULL) curr->left = new node(v); else buildTree(curr->left, v); } }
di in the else condition it should be else if(val>root->data) root->right=insertBST(root->right,val); Otherwise, it will insert the same value, and there are no duplicates in BST!
First two conditions are already mentioned very clearly so ab bas greater val ka hi case bacha tha thats why her code is working fine and your code is correct too
Not so popular, idk why, but content quality is too high. I took self paced dsa course of gfg, i was not able to understand lca but i understood from here. Its free and more important quality is far better than those costly courses
I tried doing the same bro o/p same aa raha hai but in addition this is also coming warning: control reaches end of non-void function [-Wreturn-type] }
Bro it have a return data type of node* , so you have to return some node pointer..... It is not a void function, so you can't escape without returning something!
cause it's not an entertainment video u can't binge watch them ......people who want to learn will come eventually....like me .....i reached this lecture today!
Thanks a lot
Best channel of India for c++ and DSA
Thanx aman bhaiya , I know lot of people are not valuing your effort of free education,but please countinue this for students like us who need these free education. ❤️❤️
@Vedant no budddy
Aman bhaiya very good animation and content. itna achha to college vaale 1.5 lakhs lekar bhi nahi padhaate.🔥🤘
malik jab itna kharcha ho hi gya h toh lage hath notes bhi de do
Kisi ne bina maange bikh bhi de di tabh bhi katora leke khare rehne ki aadat nhi gyi......
chutiye saale
rajpal yadav commenting 😆😆😆
bhai notes me bas code rehta hai to aisa kar video dekh kar ek baar practice to karta he hai na to vo code ek aisi file ke naam se save kar ki vo notes ka kaam karein vs code me.
bas ho gaya tera kaam.
op bhai 😂😂🤣
Bhai jab itna mehnat kar rahe ho to notes bhi bana lo khud 😂
😂
omg I've been trying to understand for several days bt this is the first video I understood clearly. thank you so much. This is my first video on your channel, and certainly i'm subscribing. keep up the good work. thank you
awesome channel for C++
awesome content, thanks every member of the team...💕😍👍💻😊🔥
The method of teaching is great. .really impressed
Bhut hi acha course hai ati uttam 2,3 baar saari videos dekhne ke baad sbb bhit asaan lagra hai
amazing video Apna College. I shattered the thumbs up on your video. Maintain up the wonderful work.
Her explanation is 🔥 lit.
Thank you ma'am I pass my Data structure Paper because of Your Tutorials
finally i understand coding thank youuuuuuuuuuuuuuu
animation+explanation!!! best content
Thanks a lot shraddha di & A.D
Please keep doing this. These videos are very helpful.
Best course ever
Bhaiya plz provide the notes.... ????
and really amazing content...
Thank u for such amazing videos ,hope this helps for my placements
Miss Good Leacture Congratulation❣❣💯💯❣❣
This Man Is Going Crazy Keep It Up 😆 Thanks You So Much For All The Lectures❤️🙏
And guys if u make notes by yourself u will learn a lot, remember when u were preparing for any exams you were able to understand easily with you notes than others
Aag lada di
Who is here after watching all previous Lectures of C++
👇
Sadly i am not : (
I am, and it feels good completing half the journey
Yes, I am......
@@adityabhandari6688 same brother...consistency is the key!!
Me
Thanks a lot team Apna College for such quality content
We don't need to take Node to be data type of buildbst,we can do it by using void also ,just we need to pass our root by reference.
Here we are kind of rebuilding the whole path from root to the new node we want to insert, instead we can do it by returning nothing
thanks didi.
Full Samaj aa gya
Thank you 🙏🙏
Really great teaching
thankew soo much
Thank you
Treee ki properties pe ek video bna do didi 🙏🙏🙏🙏🙏🙏advantage and disadvantage
Thankyou mm.
My code is not running.
I have a doubt.
When calling the insertBST function for the values other than the first one,the function returns a node pointer value but we do not store it in any variable. Will this not be incorrect?
thats actually because the insertBST function has inside it commands to do changes in the root node, so calling them makes changes in the root node itself. so we just have to assign the initial node to get the entire BST
I am not able to understand how the 7 value again go on the right of root instead of below right of 1 as there is no condition of it
Simply bcz 7 is greater than 5, hence else case will execute and 7 goes to right of 5
where are the notes
Nice
waiting
Last 30 days strategy daldo bhaiya
both the didi 's are explaning nicely , bhiaya is sometimes a bit hasty . just a review
insert vale function me ending me return root; likhna jaruri hai kya??
why are we returning the root in insertBst function and what is Node *insertBst can some one help me please
yes I have the same doubt. Can someone help?
@@adityabhandari6688 bro I skipped this topic for a while pata chale to please batana koi genuinely nahi dekh raha DS ki videos
@@zainulkhan8381 bro, i think the return root is useful for getting root's position in main() function. Just see the first two lines in main function i.e., root = insertBST(root, 5)
Is there a problem if I create a void insert function
@ApnaCollege
No
void buildTree(node *curr, int v)
{
if (v > curr->data)
{
if (curr->right == NULL)
curr->right = new node(v);
else
buildTree(curr->right, v);
}
else
{
if (curr->left == NULL)
curr->left = new node(v);
else
buildTree(curr->left, v);
}
}
Mam ye tree sting type data ya kisi or data type kalye ksy istmal krn gy?
Template bana lo.
Aman bhaiya animation pr aur videos kb aayengi ???
what if the value of the val is equal to root->data.
jadu hoga or kya?
which extention did you use for testcases run ??
HEy guys , how about we create a telegram group for discussion??
Apna doubt is the name of telegram group 👍👍
why we return the value in null case instead of replacing null value with new node(val) ......somebody help?
notes provide kerwa do sir
ASAP
well explained
di in the else condition it should be
else if(val>root->data)
root->right=insertBST(root->right,val);
Otherwise, it will insert the same value, and there are no duplicates in BST!
yeah
First two conditions are already mentioned very clearly so ab bas greater val ka hi case bacha tha thats why her code is working fine and your code is correct too
Is there a problem if i use a void function instead of node* insert
But the code is running
@@himanshuranjan5907 bro can u share the code please this pointer to function is really confusing me
Not so popular, idk why, but content quality is too high. I took self paced dsa course of gfg, i was not able to understand lca but i understood from here. Its free and more important quality is far better than those costly courses
what if i didn't write return root in last line of insertBST()
I tried doing the same bro o/p same aa raha hai but in addition this is also coming
warning: control reaches end of non-void function [-Wreturn-type]
}
Bro it have a return data type of node* , so you have to return some node pointer.....
It is not a void function, so you can't escape without returning something!
inorder ka code mia root ka right ka data kasa print ho raha ha anyone explain plz
notes dedo sir
can somebody tell where can i get the notes of this lecture..
Khud se banane padenge bro 🙃🤗
Why it's giving me error
what's the error?
@@devastrator25902 for Boolean expression it's giving me 0 instead 1
BEST be like ye ped maine kab lagaya 🤔🤔.
this code wont work for repeted no
BST is not for repeated nos
Bst have all unique values...dude that's the fundamental of BST
I am sad to see that he is doing such hard work and after 3 hours of premier of video it has only 800 views...
cause it's not an entertainment video u can't binge watch them ......people who want to learn will come eventually....like me .....i reached this lecture today!
JAB BSTINSERT KO CALL KRENGE TAB TO WO KUCH RETURN KRTA H NA,TO SIDHA
BSTINSERT KAISE CALL KR SAKTE H?
sirf ratta rataya aakr explain kr diya, koi samjh nhi ae
boba fett
I didn't get anything bad explanation😢
rip webdevelopment course
Why are you using music😑 we are here to learn not to enjoy music😢
if anyoune is from 1st year college ,kindly comment so that we can help each other in progress;
Thank you mam
rip webdevelopment course
rip webdevelopment course
These people don't reply on Yt comments..
I guess they don't even see them😢
rip webdevelopment course
rip webdevelopment course