bro your r awesome.Why your not making new videos.I am in graduation and I am studying programming from 9 class ..I have come across many teachers but you are amazing. You can be one of the best programming teachers on youtube.
You are much better than most of cocky PhD professors who needs to learn how to write neatly and speak slowly. Most of professors are trying to show off how smart they are. So arrogant ...
why should i ? i paid money to learn if they r bad they should quit and stop wasting my time ! or to do researching staff far away from teaching n wasting time !
Ali Raza u r right, u should respect ur teachers, no matter what they know or teach, and most importantly how they teach but in some cases if a teacher boasts about his knowledge in collg and that doesn't quite seem nice off course, that may be wrong on the teacher's part irrespective of whether the knowledge the teacher has is right or wrong.
@@shivamdhir640hmm I did a few that season and don’t remember which that comment was referencing but overall went like 4 for 6 offer-wise-this playlist is great, I’d crank out leetcode problems related to the topic alongside the videos
The explanation about BST was splendid but this is a master piece because you not only made the concept clear but also implementation in the actual program.. hats off
Thanks to this playlist, I've been reviewing the content of an entire college coarse so far in one day. Pay attention kids. I need to know these concepts for my job interview tomorrow.
Even though, You are long gone, your work and legacy still inspires me. Even today, when I wanted have quick refresh on my basics, I would still visit here. May you attain nibbana.
9:45 You could pass pointer by reference and that would do the job best. void insert(BstNode*& root) is the best way to pass a pointer that you want to changes its actual address. Normally, if you use BstNode*, you are passing pointer by value which means you can change the dereferenced data the pointer is pointing to but you are actually copying the address of the pointer so changing the address of the root inside function won't affect the actual address of root in main. Summary: Pass pointer by reference *& so you don't need to return the changed address to the caller. Passing pointer as a form of pointer like you do also does the job but I think it's too confusing and look superfluous.
But wouldn't it require to create a temporary pointer variable because the function is changing the address in root. I know this reply is far apart, 5 years to be precise. I am currently studying this, read your comment wondered about it
@@aditya6542 BstNode*& internally works similar to BstNode**. It means that it should consume the same memory. It's just that the syntax is easier to understand. Here's how to use it: BstNode* root = NULL; Insert(root,15); void Insert(BstNode*& root, int data) { if (root == NULL) { root = GetNewNode(data); } } I don't remember the syntax quite well because I haven't written in C++ for long now. But it should be something along that line.
@@offchan Thanks a lot for taking time to explain me. I just tried call by reference method suggested by you and it worked like a charm and the code is now even more readable.
@@offchan hey I tried code and works very well but, I have another doubt in this code, if you notice at 16:16 the root is currently pointing to address 500. but what if we want to insert 21 at left side of 20(address 300).please help I am so confused.
Unbelievable, I am really bad in English but I understand almost everything what you explain in this language, which is pretty strange for me. It is like Einstein said: If you cant explain it easy enough you do not understand it well enough. And you understand it absolutely, so your explanations get great!
Sir, a thousand of thankyou. i love you sir. i'm now preparing for my next term in computer engineering major. i'm so very happy now im study with the best code channel.
sir awesome i didnot understand the recursion from last 2 months in trees but your video is just miracle for me now i understand how the recursion is work in tree step by step keep it up sir
I really appreciate your work mister, you help me out on many of my programming problems with this videos, thank you so much :) Saludos desde Tijuana B.C. México
Perfect Video Ever On BST...Such a GlassClear Explanation...Just wanted to add here that instead of using a separate function GetNode we can manage the node creation in struct itself as below : struct Node { int data; Node* left , *rigth; Node(int data){ this->data = data; left = right = NULL; } }; So instead of calling method we need to do simply new Node(data);
You're a great teacher tbh. My teacher teaches us only how to do the BST tree and just leaves us to do the codes on our own without using the internet :(
@10:22 is there a need to write "root=" in all insert calls? Is it fine to write it only in the first insert call so the first root node is created and we have it's address. There's no need to collect return everytime, right?
Great explanation, clear, concise with good linking to previously learnt concepts both as a reinforcer as well as a reminder for those who have lost touch them them
Very good explanation with good clarity of binary search tree implementation ...I never see such good explanation anywhere ... I really appreciate the person behind this channel .. thanks for providing such nice videos
Fantastic lesson. I just want to point out that the addressing can be simplified so much by making a class instead in C++ that will save the pain of referencing addresses and whatnot.
The best video I've found on bst. God, I was stuck at the "pointer-to-pointer" code, but your code with a single pointer made my life easy. Thanks a lot!!
I felt returning and updating the root nodes after every insertion could be improved. So here is my code of using pointer to pointers. BTW this series is the best content out there. void Tree::insert(Node **rootPtr, int elem) { Node*& root = *rootPtr; //root is an alias to what is pointed by rootPtr, now instead of using *rootPtr, can use root if (root == NULL) { root = getNode(elem); cout
super good explanation! I was like "what the heack is a pointer reference' but now i get it. the new node being dynamically created is basically a pointer to a node so when calling insert privately, that is the pointer passed in as reference. Makes more sense after thinking about it more.
Thanks a lot for the clear and detailed explanations and let me correct you a little bit. You always say, that in C we can't write, say , , but always . And the point is that you can. You have to write just once - in your definition of struct. And then after closing curly brace just write BSTNode and semicolone at the end. Since then you can write a short form - just BSTNode....blabla
Best teacher in this planet ,, Heyy you can avoid writing struct node every time by using typedef keyword typedef struct BstNode { int data; BstNode *left; BstNode *right; }BST; Now we can simply use BST
Thnkuu so much sir ❣️😍😍😍method of teaching is brilliant I have seen many videos on topic trees but even any single video not help me like ur video 💞💞💞again thankuu so much GOd bless uh
Where have you been all my life? Why are you not my Professor? Only thing that would have made me love this video even more is if it was implemented as a class.
Video is great and explained every concept clearly. This video is helping ne for preparing for my exams.Thanku codeschool for making such an awesome video tutorials.
17:27 I think the second "else if" should read "else if(data < root->data) ...". The first "else if" catches the case where "root->data == data". Although, using "
(15:55--> When you want to add 25, you create a node using the first if statement, but shouldn't the first if statement execute if only the root is null, which in this case is not null. How do you create a new node? I am hell confused or may be I am misunderstanding and being stupid. And you say that the root keeps changing. But what I have understood is, the top most node is root, middle nodes are interior nodes, and end nodes are leaf nodes. But does the root node keep changing when you actually implement it?
i did it without recursion then saw your such a beautiful code, and mine is 🤦♀️🤦♀️🤦♀️... the you said ... do it without recursion then I was like 😃😃😃
8:22 C++ was derived from C,and is largely based on it,but there are some legal C constructs which are not legal C++. Conversely, ANSI C inherited several features from C++, including prototypes and const, so neither language is really a subset or superset of the other; the two also define the meaning of some common constructs differently. :)
in 17:50 isn't the condition for searching in left subtree redundant, because we are using if(datadata) but we already have covered the case where (root->data==data)?
Great videos (watched 28 of them thus far), but don't make a mistake of thinking that C++ is a superset of C. There are programs in C that won't run in C++ and there are programs in C++ that won't run in C. They've diverged in '98.
9:55 how come root does not change? For example in this code : void swap(int *x, int *y) { int temp; temp = *x; /* save the value at address x */ *x = *y; /* put y into x */ *y = temp; /* put x into y */ return; } swap(&a, &b); Value of a and b change
@17:40 In the search function the last two lines, I think we don't necessarily have to specify a return before "Search(root->left/right, data);, am I right? What's the difference if we don't specify?
sir every time a new node becoming our root but what will happen at 16:45 if i want to enter 100 or any less value than 200. because our root still at 500.
Harsha who is no more is not the one talking in all these videos. Harsha was mostly working on the website part and also a genius in programming. The one who made most of the videos is Animesh Nayan who is still alive and working for Google apparently. Animesh is probably busy with his day job, maybe isn't finding time to make new videos. I still wish he completes the series. Long live Animesh! You are like a programming god for us.
10:40 Another way would be to pass pointer reference: Insert(root,15) then void Insert (BstNode*& root, int data). This is very similar to passing address and using double pointer parameter.
15:30 what if at that stage a call is made to insert 19? The proposed function would just override the pointer to 20, and it and whatever children it might have would be lost.
You make me understand in 18 min what my teacher couldn't in 2 hours. Very Good.
Thanks :)
yes this videos are brilliant
bro your r awesome.Why your not making new videos.I am in graduation and I am studying programming from 9 class ..I have come across many teachers but you are amazing. You can be one of the best programming teachers on youtube.
that's the real thing
bro i recently find out that the guy is dead
this guy is the best teacher ever and you can't even find his name on the channel. Thank you for your work, humble Animesh Nayan.
I'm a simple man, I see recursive function, I panic.
lol me too
I thought you were a simple cat
haha.. epic
I hope you don't mind me putting this as my status
xDDDD
You are much better than most of cocky PhD professors who needs to learn how to write neatly and speak slowly.
Most of professors are trying to show off how smart they are. So arrogant ...
You should respect your teachers, no matter how they are and what they do... -_-
Ali Raza no you shouldnt,respect is earned,if they don't know how to teach then they should just quit and stop wasting everyones time
why should i ? i paid money to learn if they r bad they should quit and stop wasting my time !
or to do researching staff far away from teaching n wasting time !
Ali Raza u r right, u should respect ur teachers, no matter what they know or teach, and most importantly how they teach but in some cases if a teacher boasts about his knowledge in collg and that doesn't quite seem nice off course, that may be wrong on the teacher's part irrespective of whether the knowledge the teacher has is right or wrong.
Idiot. @@AliRazaiamaliraza
7 years later....
Teachers at clg:- Still sucks at DSA
mycodeschool:- Still rules at DSA
XD
10 years ago , and still the best data structure professor .
Better than my university professors 100 times .
Thank you dear.
Omg!, I couldn't have asked for a better explanation. It felt like I coded the whole algorithm myself. Thanks!!
Your videos are brilliant. Very clearly explained and thorough. They will help many people and you should be proud of your great work
Mike Allaway Thanks a lot :)
I second what Mike said!!
best teacher ever
8 years gone by and it still is more valuable than the class lectures
rather than just saying "thank you" in comments , we should also turn off adblocker while watching these awesome videos !
Fair
He is dead.
@@shyam5631
How do you know?
@@ekashto he was a popular person and also he was a red coder.
@@shyam5631 dude his partner passed away not him there were two guys
In 18 minutes I just learned way more than I did in class since January. Thank you so much! I cant wait to watch your other videos!
You're an angel! I'm binging the entire playlist prepping for an interview.
how did the interview go ?
@@shivamdhir640hmm I did a few that season and don’t remember which that comment was referencing but overall went like 4 for 6 offer-wise-this playlist is great, I’d crank out leetcode problems related to the topic alongside the videos
The explanation about BST was splendid but this is a master piece because you not only made the concept clear but also implementation in the actual program.. hats off
The best video I have seen until now for explaining data structures and algorithms. Fantastic! Clean and concise!
You make it so interesting ,this 18 minutes were shortest in my life.
He had a great sense in making videos. He made video in the way students who just search the keyword and don't follow the data structures courses.
Thanks to this playlist, I've been reviewing the content of an entire college coarse so far in one day. Pay attention kids. I need to know these concepts for my job interview tomorrow.
I know it's late but did you get the job? and did they ask about Data Structures?
Even though, You are long gone, your work and legacy still inspires me. Even today, when I wanted have quick refresh on my basics, I would still visit here. May you attain nibbana.
9:45 You could pass pointer by reference and that would do the job best.
void insert(BstNode*& root) is the best way to pass a pointer that you want to changes its actual address.
Normally, if you use BstNode*, you are passing pointer by value which means you can change the dereferenced data the pointer is pointing to but you are actually copying the address of the pointer so changing the address of the root inside function won't affect the actual address of root in main.
Summary: Pass pointer by reference *& so you don't need to return the changed address to the caller. Passing pointer as a form of pointer like you do also does the job but I think it's too confusing and look superfluous.
thanks man... I love you
But wouldn't it require to create a temporary pointer variable because the function is changing the address in root. I know this reply is far apart, 5 years to be precise. I am currently studying this, read your comment wondered about it
@@aditya6542 BstNode*& internally works similar to BstNode**. It means that it should consume the same memory. It's just that the syntax is easier to understand. Here's how to use it:
BstNode* root = NULL;
Insert(root,15);
void Insert(BstNode*& root, int data) {
if (root == NULL) {
root = GetNewNode(data);
}
}
I don't remember the syntax quite well because I haven't written in C++ for long now. But it should be something along that line.
@@offchan Thanks a lot for taking time to explain me. I just tried call by reference method suggested by you and it worked like a charm and the code is now even more readable.
@@offchan hey I tried code and works very well but, I have another doubt in this code, if you notice at 16:16 the root is currently pointing to address 500. but what if we want to insert 21 at left side of 20(address 300).please help I am so confused.
Sad to feel that this legend is no more in this world!!!!
He will still remain eternal on TH-cam and help everyone forever!!!!
What??
@@souravsingh763 yup bro...He succumbed to his injuries.
Unbelievable, I am really bad in English but I understand almost everything what you explain in this language, which is pretty strange for me. It is like Einstein said: If you cant explain it easy enough you do not understand it well enough.
And you understand it absolutely, so your explanations get great!
*Could you please teach my teacher ?????*
LOL HAHAHAHA
Best comment =))))
Bro,,He is no more 😢
@@abhi_pandit16 Bro what are you telling?
@@abhi_pandit16 seriously ???
10 years later, here we are
the idea of pause and play in recursion is lit, great job!!
Sir, a thousand of thankyou. i love you sir. i'm now preparing for my next term in computer engineering major. i'm so very happy now im study with the best code channel.
3:08 A self-note;
Any object created in dynamic memory/heap can only be accessed through pointers.
yup
sir awesome i didnot understand the recursion from last 2 months in trees but your video is just miracle for me now i understand how the recursion is work in tree step by step keep it up sir
You are an excellent teacher. Very organized with perfect graphics.
How simple man, thanks god we have India
Great work Sir, RIP legend, still revising this material.
what happen to him?
I haven't even started this video and I already know it will be amazing due to your previous videos. Thanks for the helpful video!
we learn it here in minutes because our teachers spent hours to make base for this............very good video
I really appreciate your work mister, you help me out on many of my programming problems with this videos, thank you so much :)
Saludos desde Tijuana B.C. México
Perfect Video Ever On BST...Such a GlassClear Explanation...Just wanted to add here that instead of using a separate function GetNode we can manage the node creation in struct itself as below :
struct Node
{
int data;
Node* left , *rigth;
Node(int data){
this->data = data;
left = right = NULL;
}
};
So instead of calling method we need to do simply new Node(data);
You're a great teacher tbh. My teacher teaches us only how to do the BST tree and just leaves us to do the codes on our own without using the internet :(
I am glad I stumble upon this video to understand BST. Thank you and keep up the good work!
@10:22 is there a need to write "root=" in all insert calls? Is it fine to write it only in the first insert call so the first root node is created and we have it's address. There's no need to collect return everytime, right?
I was looking for this exact comment only
I am thinking the same dude
Great explanation, clear, concise with good linking to previously learnt concepts both as a reinforcer as well as a reminder for those who have lost touch them them
Very good explanation with good clarity of binary search tree implementation ...I never see such good explanation anywhere ... I really appreciate the person behind this channel .. thanks for providing such nice videos
your implementation is better than my University teacher,thank you
IN 2020, You still the best teacher bro,ur teach so good
Fantastic lesson. I just want to point out that the addressing can be simplified so much by making a class instead in C++ that will save the pain of referencing addresses and whatnot.
10:23 double pointer part saved me thank you so much
code in C language
#include
#include
struct bst{
int data;
struct bst* left;
struct bst* right;
};
struct bst* newnode(int data)
{
struct bst* temp=(struct bst*)malloc(sizeof(struct bst));
temp->data=data;
temp->left=NULL;
temp->right=NULL;
return temp;
}
struct bst* insert(struct bst* root, int data)
{
if(root==NULL)
{
root=newnode(data);
}
else if(data data)
{
root->left =insert(root->left,data);
}
else
{
root->right=insert(root->right,data);
}
return root;
}
int search(struct bst* root,int data)
{
if(root==NULL)
{
return 0;
}
if(root->data=data)
{
return 1;
}
else if(data data)
{
return search(root->left,data);
}
else
{
return search(root->right,data);
}
return data;
}
int main()
{
struct bst* root=NULL;
root=insert(root,15);
root=insert(root,10);
root=insert(root,20);
root=insert(root,25);
root=insert(root,8);
root=insert(root,12);
int num;
printf("Enter a number to search
");
scanf("%d",&num);
if(search(root,num)==1)
{
printf("number is found");
}
else
{
printf("number is not found");
}
}
The best video I've found on bst. God, I was stuck at the "pointer-to-pointer" code, but your code with a single pointer made my life easy. Thanks a lot!!
I felt returning and updating the root nodes after every insertion could be improved. So here is my code of using pointer to pointers. BTW this series is the best content out there.
void Tree::insert(Node **rootPtr, int elem)
{
Node*& root = *rootPtr; //root is an alias to what is pointed by rootPtr, now instead of using *rootPtr, can use root
if (root == NULL)
{
root = getNode(elem);
cout
super good explanation! I was like "what the heack is a pointer reference' but now i get it. the new node being dynamically created is basically a pointer to a node so when calling insert privately, that is the pointer passed in as reference. Makes more sense after thinking about it more.
Thanks a lot for the clear and detailed explanations and let me correct you a little bit. You always say, that in C we can't write, say , , but always . And the point is that you can. You have to write just once - in your definition of struct. And then after closing curly brace just write BSTNode and semicolone at the end. Since then you can write a short form - just BSTNode....blabla
Haven't learned C/C++ before but got it thoroughly. Thanks !!!!!!!
Best teacher in this planet ,,
Heyy you can avoid writing struct node every time by using typedef keyword
typedef struct BstNode
{
int data;
BstNode *left;
BstNode *right;
}BST;
Now we can simply use BST
it would become confusing for beginners.Thats why he always keeps telling the syntactical sugar thing for ->
@@vishalvibes_ sugar thing? you moron.
@@prince5922 PKMKB
A very clear and precise video lecture. I was searching for this type of video. Thank you
rest in peace.
you are the best.
You teach great.
BEST EXPLANATION, Better than all the teachers :)
Thnkuu so much sir ❣️😍😍😍method of teaching is brilliant I have seen many videos on topic trees but even any single video not help me like ur video 💞💞💞again thankuu so much GOd bless uh
Best data structure tutorial I have ever seen
Thank you sir. You have a very clear step-by-step manner explanation of the BST design. [prayer]
your explanation and coverage of examples are very good sir,, Thank you
there should be a button for salutation. like is not enough to express my gratitude
i could not leave this vedio without giving thanks to you
You make so much more sense then my teacher, many thanks
Where have you been all my life? Why are you not my Professor? Only thing that would have made me love this video even more is if it was implemented as a class.
hey i just found you, and this is crazy, but here's my like and my subscribe, because i have a feeling that you are going to save my entire module.
Really Great explanation better than my professor.
Awesome
Video is great and explained every concept clearly. This video is helping ne for preparing for my exams.Thanku codeschool for making such an awesome video tutorials.
Best 18 min on trees
I wish I could like this video more than once, pure gold!
thx for everything you've made everything much simplier to understand ,you're brilliant sir
17:27 I think the second "else if" should read "else if(data < root->data) ...". The first "else if" catches the case where "root->data == data". Although, using "
(15:55--> When you want to add 25, you create a node using the first if statement, but shouldn't the first if statement execute if only the root is null, which in this case is not null. How do you create a new node? I am hell confused or may be I am misunderstanding and being stupid. And you say that the root keeps changing. But what I have understood is, the top most node is root, middle nodes are interior nodes, and end nodes are leaf nodes. But does the root node keep changing when you actually implement it?
Had been waiting for this implementation video!!! Thank you!!!
haw....... what a video remove all confusions in mind in single shot with in 20mins u rocks good video
i did it without recursion then saw your such a beautiful code, and mine is 🤦♀️🤦♀️🤦♀️... the you said ... do it without recursion then I was like 😃😃😃
great to have a class on this, that benefited me, which my college can't provide. thanx a lot!
8:22 C++ was derived from C,and is largely based on it,but there are some legal C constructs which are not legal C++.
Conversely, ANSI C inherited several features from C++, including prototypes and const,
so neither language is really a subset or superset of the other; the two also define the meaning of some common constructs differently. :)
in 17:50 isn't the condition for searching in left subtree redundant, because we are using if(datadata) but we already have covered the case where (root->data==data)?
17:50 sorry for the typo.
You are such a great presenter. Thank you, keep up the good work
Excellent discussion on Data Structures, great detail and crisp content. Thanks. Yusuf Arif
Great videos (watched 28 of them thus far), but don't make a mistake of thinking that C++ is a superset of C. There are programs in C that won't run in C++ and there are programs in C++ that won't run in C. They've diverged in '98.
From what i see, using your algorithm, root ptr will change to the inserted node in main. So you would lose access to all previous nodes in tree
no actually we are not losing the root node.... check after 14th minute
The most amazing explanation with proper example+animation. Cheers !! Helped a lot !! Thanx !
Great explanation- the play and pause symbols really help! Thanks a lot :)
9:55 how come root does not change?
For example in this code :
void swap(int *x, int *y)
{
int temp;
temp = *x; /* save the value at address x */
*x = *y; /* put y into x */
*y = temp; /* put x into y */
return;
}
swap(&a, &b);
Value of a and b change
Rest In Peace Animesh Sir. We will make you proud someday after learning from your lessons.
Bhai wo zinda hain, harsha sir ka accident hua. Animesh sir google mein kaam kar rhe.
Excellent coverage -- this is better than I had back in college.
Your tutorials are so easy to understand. Great job :] and Thanks :)
can we use "call by reference" at 11:00 for getting the update in rood node ??????
It's really helpful for my final exam!! Thanks for your hard work! ;)
@17:40 In the search function the last two lines, I think we don't necessarily have to specify a return before "Search(root->left/right, data);, am I right? What's the difference if we don't specify?
sir every time a new node becoming our root but what will happen at 16:45 if i want to enter 100 or any less value than 200. because our root still at 500.
End sir g your way of explain are so easy❤
Sir I really appreciate you effort to make us clarified
simplicity at its best
You make incredibly good tutorials, thank you so much for sharing them with us.
17:47, in main function if(search(root,number)==true) , what will be the value of root initially?
That was soo clearly explained. Thank You.
please upload the tutorials on hash table implementation and AVL trees.
sadly he is no more :(
he is no more among us. he passed away.
Then who is looking after mycodeschool
Seeing that the last video is more than one year old I'm going to go out on a limb and guess...nobody. Sad to hear he died.
Harsha who is no more is not the one talking in all these videos. Harsha was mostly working on the website part and also a genius in programming. The one who made most of the videos is Animesh Nayan who is still alive and working for Google apparently.
Animesh is probably busy with his day job, maybe isn't finding time to make new videos. I still wish he completes the series.
Long live Animesh! You are like a programming god for us.
10:40 Another way would be to pass pointer reference: Insert(root,15) then void Insert (BstNode*& root, int data). This is very similar to passing address and using double pointer parameter.
15:30 what if at that stage a call is made to insert 19? The proposed function would just override the pointer to 20, and it and whatever children it might have would be lost.
Thanks for the code its very useful for me and its very clear to understand thanks once again
Lovely lesson..... very clearly explained thankyou