Please Comment, Subscribe and Click Bell🔔🔔🔔 Icon for More Updates. To learn software course from our experts please register here for online training: goo.gl/HIB0wL
Sir Is am Madhavan B Tech IT 2nd Year.sir Teach in Tamil language much be better for government school students.but your' s explanation is very good.Thank you sir
*Duplicates aren't allowed.* By the definition of Binary Search Tree, the values greater than the root node must be placed to its right and the value lesser than the root node must be placed to its left. Hence, duplicates don't have any proper location in a binary search tree. Moreover, while inserting a new node, you may add a condition to check if the data of new node is equal to the current node, while traversing. In this case, you may print the message, that node is already present.
Your class is so interesting and much clear and to the point. Thanks for sharing your knowledge and experience. do you have BST Binary Search Tree and its operation ( insertion, deletion, and traversal ) in Java? I mean the same class you have done in C I want them in java. please share link if you already have done it. Thanks
If you want duplicate entries, you can add it as a right child. Otherwise just print a message saying that duplicate entries are not allowed or insertion is not possible and then return. To gather more information, you can google duplicate entries in BST(binary search tree). Good day!
there can be two similar values ... but it depends on the programmer how he codes.. please read. www.geeksforgeeks.org/how-to-handle-duplicates-in-binary-search-tree/
does root when we assign to p in insert function have to be p -> data = root-> data; instead of just p= root; 8.24 minute this is the error "a value of type struct Node can't be assigned to an entity of type struct Node"
Please Comment, Subscribe and Click Bell🔔🔔🔔 Icon for More Updates. To learn software course from our experts please register here for online training: goo.gl/HIB0wL
you are the best data structure teacher of all times. thankyou sir
Hi bro what are u doing now ....
Honestly you are the best instructor of Data Structure. thanks alot!
this is really one of the best c programming youtube channel
Sir your explanation of program with an example has helped me a lot.
Best teacher I have seen... really helpful sir💯 thank you so much✌️🔥
The way u explained this program it makes doubts very clear. Thanks a lot.
Sir, your teaching is really helps to clear the concept. Please make videos on graph data structure.
best teacher on youtube
Thank you for the explanation, sir. I have now a better understanding of BSTs.
very easy and simple code...and wonderful explanation
Thank you so much sir for such great lectures..the way you explained is just awesome..it becomes very easy to understand the concepts.
SIR you saved me, today was my practical exam.
one of the best lecturers
sir your teaching way is really good
What a teacher man❣️
best teacher👍👍👍👍
Sir, thank you, it helps a lot
Best teacher.. 👌
sir i want more videos of data structures from you please sir.Your teaching is so effective
You explain so well sir
well explained sir tree is cleared
Amazing explanation sir 👌👌👌👌👌
NICE SUPER EXCELLENT MOTIVATED
Thank-you sir!👏👏👏👏👏👏
Explained really well!!
Amazing lecture sir thankyou!
very easy code and best technique to understand .....thanks sir
Are topaa....
Sir Is am Madhavan B Tech IT 2nd Year.sir Teach in Tamil language much be better for government school students.but your' s explanation is very good.Thank you sir
best sir ever !!! thanks sir !!!
Way of exaplaining good sir thank u
Best explanation.!!
picture perfect sir,,,,,🤩😍
please upload some lectures of graph (data structure)....asap
sir if one another 50 is present then where we can insert
*Duplicates aren't allowed.*
By the definition of Binary Search Tree, the values greater than the root node must be placed to its right and the value lesser than the root node must be placed to its left.
Hence, duplicates don't have any proper location in a binary search tree.
Moreover, while inserting a new node, you may add a condition to check if the data of new node is equal to the current node, while traversing. In this case, you may print the message, that node is already present.
Sir,please explain the time complexity
Your class is so interesting and much clear and to the point. Thanks for sharing your knowledge and experience. do you have BST Binary Search Tree and its operation ( insertion, deletion, and traversal ) in Java? I mean the same class you have done in C I want them in java. please share link if you already have done it. Thanks
please sir uploading another videos data structures.
your metode is mind catching
Sir superb teaching sir
Sir what if current->data is equal to parent->data!
Where will be the new node connected at right or left ?
If you want duplicate entries, you can add it as a right child. Otherwise just print a message saying that duplicate entries are not allowed or insertion is not possible and then return. To gather more information, you can google duplicate entries in BST(binary search tree). Good day!
Sir, you are the best...
20:43 crazy asitisthos
no one is ferfect....xD
Well elaboration sir....❤️
sir you are great...
Sir,please explain dictionary program with an example in data structures.
Oh
Sir, it would be very much helpful if u would attach a txt or c file with program code in it at the end of every topic
sir one problem, if we having same element, like 5, and one more element 5, so where it is insert right og 5, or left of 5 , if one of them is nod
there can't be two similar values,if user insert any same value you can write a error statement.
there can be two similar values ... but it depends on the programmer how he codes.. please read.
www.geeksforgeeks.org/how-to-handle-duplicates-in-binary-search-tree/
That link was helpful.
Thanks buddy.
I think we can write >= or
Sir please upload height of the node
Sir, how do we deal with nodes having the same values?
In binary search tree nodes cant have the same value
Roronoa Zoro, be world's greatest swordsman one day!
instead of t.data i think t->data should be there
Same confusion
@@YashSharma-cn1wz except -> u can also use (*tmp).data
Sir what if we want store two same numbers
that's the problem with this code, and if i want to add 67 to the left child of 55 then? that's also problem
sir please upload data structures in c++
sir pleas upload all type of sorting lectures
please uploading another videos data structures
well explained sir
i think it will be t->data=d check 9:43
t.data=d is correct i think..bcz data is int type variable..
can i get the full code for this concept
can we insert a node in middle of a tree by this algorithm?
Yes
sir if you do it practicaley programe so its consider a 5 min extra but its very helpul to everyone
sir u said about the right side of the parent node then wt condition should we change in order to place the element 18 in the list
Sir please upload graphs,hashing and file organization in data structures
watching in Kanpur
Always amazing
sir i want merge sort and quick sort algorithms and programs
please upload Graph and it's operations in DS
Sir is it necessary to study binary tree before bst
thank you so much sir!
P is created but not used in this context
Sir i have a doubt that we can use curr know every time . What is the reason of copying it to the parent everytime 🤔
very good
why does t.data = d; give me an error?? And how can I fix it pls?
t->data=d;
@@prabha20028 Thanks
@@malcolmagius5812 can I have full code how to create multiple nodes in bst?
why we are taking 2 pointers, parent and current to store root value?
Nicely explain sir ..plz provide source code
Thanks sir
can any1 give full program for insertion drleyion and traverse
Sir How to get #algorithm and #material for make it more easy
16:51 lol
Current Shock! 🙂
hahaha
Sir, What is threaded binary tree??
can we insert character type data in anode
Sir please give a complete code for BST deletion
sir please more video upload
Sir please add heap sort video.
if we have to insert same values two times in BCT
Everything I understand !!!! Bust inside we use current!!! I could not get that!!!
fantastic
Why so many ads?
Everything comes with a price tag :)
types of binary search tree upload plzzz
U thopu sir....
please can anyone refer me a good book which can be helpful to understand data structures and algorithms ?
Real time application lo ekkada use chestaru
Thanks
what will happen if the data value is equal
does root when we assign to p in insert function have to be p -> data = root-> data; instead of just p= root; 8.24 minute this is the error "a value of type struct Node can't be assigned to an entity of type struct Node"
8:24
sir apne srrruct node *p initialise kia h lekin hr jagh ap parent nam le rhe he ....jbki parent to khhi declare hi nhi kiya
Good
Anyone help me more with this program
Sir plz improve the audio quality!
Parent pointer have not declare
goood
Tough af 😢