You are a superb teacher ma'm. Because you have a good grasp on clear precise use of the language while not sounding abstract at all. You don't waste time doing peripheral things and put that time into clarifying the concepts very systematically. I wish you all the very best in all the things you do. In a country like ours, students feel so happy when a teacher does his/her job right because it is not the rule, it's the exception. Thanks for reviving my hope.
When i started dsa it was very difficult and i suddenly watched this video it was so easy now after watching every single video of yours on dsa i learned a lot and finds dsa is one of the most easy subject keep doing u r the best teacher i ever met
Thank you! It was very helpfull. I also loved that you sometimes speak in your language and say 'tike' in order to 'ok' I want to answer you in my language 'Peki'.
In short: In-Order traversal of any BST is Sorted data in ascending order. To find ROOT - take help of Pre-Order traversal. To find Left & Right sub-trees - take help of In-Order traversal.
Mam we can simply construct it directly using pre-order only ,there is no need to find inorder if we find and construct then It is same as constructing binary tree from pre-order and inorder.
Amazing explanation you can not find something like that!!! small note: i don't know if i'm wrong or you did a mistake but at min 6:10 17 , 18 should be to the right but on the other hand it makes sense that because it is a bst so smaller on the left and larger on the right so which is correct?
Thanks alot ma'am i am cse student but i never understood the data structure this easliy before but now i happy as after watching your videos i am easliy able Learn this things.
Great video! Actually this is not needed though. You can simply consruct BST from pre order traversal alone. Pre order is the order in which elements were added to make the BST so it works independently.
One can simply find the BST only from pre order or post order. By definition, all the elements in the left subtree of a node are smaller than the node and the ones in the right subtree are greater than the node. It would be efficient while actually writing the code.
Hi can you please also explain the code of all these problems? Im not preparing for GATE ...but for interviews. In interviews... we have to do the live coding.
Mam Just had a request if you could suggest some online materials or book to improve algorithms and get the understandings of problem solving like you!
Mam but this is not binary search tree it doesn't follow the rules of it as in right sub tree height of 60 is -2 which is not under the condition of bst. Have we use LR AND RL to make it BST? Please reply mam. BTW your videos are so good I have already subscribed your channel
hi, jenny . is it necessary to find out in-order traversal to construct the bst ? if we have given pre-order / post-order travesal .. can't we construct bst with either pre-order or post-order only... ?
OOP in C++ is just a Design Pattern. First, learn all the Basics of C++, then Have some understanding of Encapsulation, Abstraction, Inheritance, and Polymorphism. Then watch some videos of TheCherno. You will be good to go.
Because 60 comes first in Pre-order and 85 is greater than 60 so, 85 will become the right child of 60. In BST the left child has smaller value than the root and the right child has greater value than the root.
First find inorder and then take a pair of either pre-order and inorder or postorder and inorder .. and construct bst. ... if you write the given data in ascending order then that would be inorder of bst
What should we do if any key value is repeated? Mtlb agr koi number repeat ho rha ho ga tou hum usy kaise BST mai store karin gay Plzz plzz reply If anyone know the answer plzz tell
You are a superb teacher ma'm. Because you have a good grasp on clear precise use of the language while not sounding abstract at all. You don't waste time doing peripheral things and put that time into clarifying the concepts very systematically. I wish you all the very best in all the things you do.
In a country like ours, students feel so happy when a teacher does his/her job right because it is not the rule, it's the exception. Thanks for reviving my hope.
When i started dsa it was very difficult and i suddenly watched this video it was so easy now after watching every single video of yours on dsa i learned a lot and finds dsa is one of the most easy subject keep doing u r the best teacher i ever met
Bhai ye college level hi hai asli dsa tough hi hota hai
thanks from miami :)
Vice City 💙
Thank you! It was very helpfull.
I also loved that you sometimes speak in your language and say 'tike' in order to 'ok' I want to answer you in my language 'Peki'.
What is your native language??
Best learning expreince from my view
Best Explanation in World!
In short:
In-Order traversal of any BST is Sorted data in ascending order.
To find ROOT - take help of Pre-Order traversal.
To find Left & Right sub-trees - take help of In-Order traversal.
that's O(nlogn) approach. you can find in O(n) also
@@charan775 u do video on that
I like your explaination of inorder in that it gives you an ascending order.
Mam we can simply construct it directly using pre-order only ,there is no need to find inorder if we find and construct then
It is same as constructing binary tree from pre-order and inorder.
She is teaching to my soul directly.
Superb!!!❤️❤️❤️Thanks a zillions! ❤️❤️......how you are amazing as teacher i can't express
Mam jab aap fluently English ke bich mein hindi bolte hai to bhut accha lagta hai ki aapko hindi bhi itna accha aata hai 🥰🥰🥰🥰🥰🥰😍😍😍😍
You are super ma'am.....
You can teach in hindi and english both also......
You are best👍👍👍
excellent explanation. loved it. Thanks
Amazing explanation you can not find something like that!!! small note: i don't know if i'm wrong or you did a mistake but at min 6:10 17 , 18 should be to the right but on the other hand it makes sense that because it is a bst so smaller on the left and larger on the right so which is correct?
Thanks alot ma'am i am cse student but i never understood the data structure this easliy before but now i happy as after watching your videos i am easliy able Learn this things.
finally tick mil gya . congrats maam keep go ahead and make videos ..thankuhh!!
Great video! Actually this is not needed though. You can simply consruct BST from pre order traversal alone. Pre order is the order in which elements were added to make the BST so it works independently.
best explanation . made me to watch your all playlist
Ma'am we can easily make BST by preorder only by remembering rule of BST
yupp we can, but that solution will be of order O(nlogn), as you have to traverse from root everytime (log-n) for n nodes.
*The attitude, killing* 😍😍😍
Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏
Thanks mam you are born in combination with beauty & brains
I wish you were my lecturer, actually make this fun to learn
Brilliant explanation! Thank you so much!
One can simply find the BST only from pre order or post order. By definition, all the elements in the left subtree of a node are smaller than the node and the ones in the right subtree are greater than the node. It would be efficient while actually writing the code.
It will work only if you are given numbers, consider if u were given alphabets, then it won't be possible.
You Made it Easy, Thank you very much.
You explain it so well! Thankyou
Thank you mam this video is very helpful full ...
It's very useful madam. Nice explanation
Thanks a lot it's very helpful for me 😊 for understanding BST construction
Super teaching skill......
Best teaching......
thank u for saving our asses
Super explanation...👌👌👍
Very much thankfull to you for such a wonderful teaching
Hi can you please also explain the code of all these problems?
Im not preparing for GATE ...but for interviews.
In interviews... we have to do the live coding.
I never learnt it in my college. Thanks mam.
Explained 👌🏻👌🏻👌🏻
Ese Lagta h har waqt, Jese aap abhi hans doge 😅.....
All videos are helpful ....Thanku mam 🥰🥰
Mass🔥🔥 explaination mam thank u
Very cleary explaination
Mam Just had a request if you could suggest some online materials or book to improve algorithms and get the understandings of problem solving like you!
She is so cute
It helps me a lot ma'am
Thank you
Thanks mam. Very good explanation.
Best teacher
Super explanation.. Thanks🌹
thank u ma'am ❤️❤️❤️
thanks for this clear explaining
Awesome 👌 😮
thank you very much
Really u save me
Thank you madam
Mam but this is not binary search tree it doesn't follow the rules of it as in right sub tree height of 60 is -2 which is not under the condition of bst. Have we use LR AND RL to make it BST? Please reply mam. BTW your videos are so good I have already subscribed your channel
that is avl tree bro
Thank you so much ma'am!😊😊
*Mam please guide me . I am good learner and only follows your lectures. Please mam tell me how the coding part can be done*
Maam pl tell the coding part
Lol, she liked and ignored the question :p
good explanation
Thanks mam
Useful....
thanks for the tutorial
Thanks, keep going.
Mam you look soo good🥺
your explanation awesome but kindly divide and conquer ki binary search and linear search tree share krde......
Thanks for saving my exam, mam, you are really cool!
Thank u
hi, jenny . is it necessary to find out in-order traversal to construct the bst ? if we have given pre-order / post-order travesal .. can't we construct bst with either pre-order or post-order only... ?
👌👌 explanation
Thnku mam
My question is
The post order traversal of a binary tree is D E B F C A .find out the pre order traversal????
Ma'am when we have numbers equal to node elements, do we duplicate them? Or ignore them?
duplicate nodes are not allowed in BST(mostly)
Thanks
Madam,is programs are important for trees and graphs topic???
Please reply madam
Mam cplus plus ke bhi bnado lecture plzz
Plz make a playlist on oops concepts in c++ as no good content is available yet
OOP in C++ is just a Design Pattern. First, learn all the Basics of C++, then Have some understanding of Encapsulation, Abstraction, Inheritance, and Polymorphism. Then watch some videos of TheCherno. You will be good to go.
@@TheMR-777 I Agree,
super thankyou mam
🔥🔥🔥
verrrrrrrry niceeeeeee thx
Your explaination was so good and you are too cute
take care c u....in 5.12
Could someone explain me why in the left root 60 is put first in front of the 85? why 85 is on a lower branch compared to 60?
Because 60 comes first in Pre-order and 85 is greater than 60 so, 85 will become the right child of 60.
In BST the left child has smaller value than the root and the right child has greater value than the root.
Hello Madam... i want a program that insert ,search and displays elements of BST. i didn't got on your video is there??? please help me
Cute mam 😍👌👍
Mam u are so beautiful ❤️❤️❤️
What is it for + * - and abc is in question
I understand bst formation but don't know how u write Inorder when preorder is given only.
Mam what are the applications of Binary Search tree?
Nothing can replace a whiteboard✌
mam, how to solve problem when only inorder is given?
But when only inorder is given then how can we find pre and post
If they give pre order and post order. How ll create bst?
First find inorder and then take a pair of either pre-order and inorder or postorder and inorder .. and construct bst. ... if you write the given data in ascending order then that would be inorder of bst
Jenny I am not able to join the channel...My payment method or any Card I am putting in, is not being accepted.
Mam, how to make code for this...
First root then it construct easily
🖤🔥
What should we do if any key value is repeated?
Mtlb agr koi number repeat ho rha ho ga tou hum usy kaise BST mai store karin gay
Plzz plzz reply
If anyone know the answer plzz tell
In a BST, repetition of a Particular value is strictly prohibited, all data are unique, else it can't form BST.
half of the views coming from UPES students. :P
❤️
What is weight of this tree?
❤️❤️❤️❤️❤️