5.11 Construct Binary Search Tree(BST) from Preorder example |Data Structures & Algorithm

[@soutrikgun9133]

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.

[@princejunior4330]

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

[@saurav.mishra528]

Bhai ye college level hi hai asli dsa tough hi hota hai

[@cs-atulkumartripathi4865]

Mam jab aap fluently English ke bich mein hindi bolte hai to bhut accha lagta hai ki aapko hindi bhi itna accha aata hai 🥰🥰🥰🥰🥰🥰😍😍😍😍

[@raman-jn6yt]

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.

[@charan775]

that's O(nlogn) approach. you can find in O(n) also

[@phanigaming4887]

​@@charan775 u do video on that

[@dar4371]

Best learning expreince from my view

[@ayushsuryawanshi5985]

She is teaching to my soul directly.

[@cdeba9867]

thanks from miami :)

[@vednande6192]

Vice City 💙

[@miogallobianco1]

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'.

[@siddhartharaja9413]

What is your native language??

[@ChandraShekhar-by3cd]

Best Explanation in World!

[@rahultalekar2909]

You are super ma'am..... You can teach in hindi and english both also...... You are best👍👍👍

[@hardikmakhija4470]

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.

[@nicholaskong1673]

I like your explaination of inorder in that it gives you an ascending order.

[@Artificial_world383]

i am gonna roar in the examination hall ,questions will run like deer and will jump on them like lion🔥🔥. thank you soo much.

[@swatantrapatel7608]

finally tick mil gya . congrats maam keep go ahead and make videos ..thankuhh!!

[@hxxsk]

I wish you were my lecturer, actually make this fun to learn

[@jobseeker7624]

Superb!!!❤️❤️❤️Thanks a zillions! ❤️❤️......how you are amazing as teacher i can't express

[@rahuldeshpande3516]

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.

[@sachinkulkarni9108]

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.

[@AdityaSingh-ql9ke]

It will work only if you are given numbers, consider if u were given alphabets, then it won't be possible.

[@meghaharlalka]

excellent explanation. loved it. Thanks

[@ravalisaienugandula3900]

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.

[@unknown___person]

I never learnt it in my college. Thanks mam.

[@abhishekabhi3252]

Thanks mam you are born in combination with beauty & brains

[@paathshaala7266]

Explained 👌🏻👌🏻👌🏻 Ese Lagta h har waqt, Jese aap abhi hans doge 😅.....

[@sahilmallick261]

best explanation . made me to watch your all playlist

[@puneeth5219]

Best teaching......

[@puneeth5219]

Super teaching skill......

[@rafeeq3325]

*The attitude, killing* 😍😍😍

[@vakhariyajay2224]

Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏

[@24_bhagyashreekanamadi70]

Best teacher

[@rehanhussan]

Thanx :)

[@SherlinSVimal]

It's very useful madam. Nice explanation

[@jayshrikhamk97]

Very cleary explaination

[@Samantha_3619]

Super explanation...👌👌👍

[@YasirKhan-bl8lj]

You Made it Easy, Thank you very much.

[@shidu00]

All videos are helpful ....Thanku mam 🥰🥰

[@neethikrajav8214]

Thanks a lot it's very helpful for me 😊 for understanding BST construction

[@mia4224]

You explain it so well! Thankyou

[@nazirshams6040]

Very much thankfull to you for such a wonderful teaching

[@sakethsakhii249]

Mass🔥🔥 explaination mam thank u

[@sourabhsinghyadav5637]

Thanks mam. Very nice explanation.

[@abinayaathmaraman3861]

thank u for saving our asses

[@arkalykakash9475]

Brilliant explanation! Thank you so much!

[@rxc6970]

It helps me a lot ma'am Thank you

[@zaidabdulkarim2125]

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?

[@AnujKumar-tt5md]

Super explanation.. Thanks🌹

[@debaratighatak2211]

Thank you so much ma'am!😊😊

[@explore_with_shanu]

Ma'am we can easily make BST by preorder only by remembering rule of BST

[@twerkyfingers]

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.

[@Nikhi_lesh]

Mam you look soo good🥺

[@ساراعبدالهاديكريمالسليمي]

thanks for this clear explaining

[@anuj723]

thank u ma'am ❤️❤️❤️

[@asrEthio]

Really u save me

[@lauraudvari7715]

Thanks for saving my exam, mam, you are really cool!

[@arnoldsmith6584]

good explanation

[@renukas3223]

Thank you madam

[@cupoftea2173]

Awesome 👌 😮

[@sudharshandinnu3988]

She is so cute

[@kaleabd4761]

thank you very much

[@adeli583]

Thanks, keep going.

[@iscaqfaizal7734]

Useful....

[@jayshrikhamk97]

Thanks

[@Motivationalsai6252]

👌👌 explanation

[@amaywadar5334]

thanks for the tutorial

[@ShaliniSingh-xc5rn]

Thnku mam

[@shinosukenohara2985]

take care c u....in 5.12

[@indritdogjeni2469]

Thank u

[@aruppal1909]

Mam u are so beautiful ❤️❤️❤️

[@_gauravkumar]

Nothing can replace a whiteboard✌

[@shizazahid3537]

your explanation awesome but kindly divide and conquer ki binary search and linear search tree share krde......

[@charanchandu7622]

Your explaination was so good and you are too cute

[@nitraipurwitharunchauhan9292]

Thanku 🤗 mam

[@Elias-hj7yv]

verrrrrrrry niceeeeeee thx

[@studywithriyagupta1259]

Mam cplus plus ke bhi bnado lecture plzz

[@continnum_radhe-radhe]

🔥🔥🔥

[@mantubhattacharya6238]

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

[@maninderbhambra3796]

that is avl tree bro

[@saxena3718]

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.

[@surendrakumars638]

super thankyou mam

[@rutweakchacha1558]

For binary tree also we use this method right??

[@ChandraShekhar-by3cd]

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!

[@willturner3440]

*Mam please guide me . I am good learner and only follows your lectures. Please mam tell me how the coding part can be done*

[@rakshitmandilwar2817]

Maam pl tell the coding part

[@twerkyfingers]

Lol, she liked and ignored the question :p

[@amitdevgan2530]

First root then it construct easily

[@rudranshusahoo5147]

Cute mam 😍👌👍

[@be_prepared]

Plz make a playlist on oops concepts in c++ as no good content is available yet

[@TheMR-777]

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_63]

@@TheMR-777 I Agree,

[@zissu848]

We can find directly by making BST of preorder 😅

[@pankajkhot4410]

My question is The post order traversal of a binary tree is D E B F C A .find out the pre order traversal????

[@nomeowzoey]

half of the views coming from UPES students. :P

[@vishnukumard5377]

❤️

[@shidu00]

❤️❤️❤️❤️❤️

[@opslash7971]

What is it for + * - and abc is in question

[@ksriram1997]

🖤🔥

[@alexomelak4200]

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

[@ee214verilogtutorial2]

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?

[@manmeetsingh4719]

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.

[@smitarai9098]

Superb cutie my mam

[@shahnazjamadar3109]

U resemble Manisha qoirala

[@shinosukenohara2985]

HI..love u too...

[@vineethm9305]

mam, how to solve problem when only inorder is given?

[@amoghp6347]

Mam what are the applications of Binary Search tree?

[@upendrabind7442]

I understand bst formation but don't know how u write Inorder when preorder is given only.

[@CSBAjay]

Madam,is programs are important for trees and graphs topic??? Please reply madam

[@gurupreetsingh8347]

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... ?

[@manishreddy5105]

DON'T WEAR GREEN CLOTHES MA'AM, USE SOME LIGHT COILOURS THAT SUITS YOU BETTER. #BIGFAN