Lec-55: Find Preorder, Postorder & Inorder of Binary Search Tree(BST) in Data Structure

[@sahilsharma7013]

It was most confusing question to me but today u provided cheat code to solve it. Sir u r truly genius

[@poojapoojadhapte1430]

Beatiful sir tommorrow i having exams so beautiful

[@sandeep-shaw]

Made my concept fully crystal clear Thanks a lot

[@himanshurana5880]

mere sir se jyada aap jante ho... thank you trick ke liye...🙏🏻 tution wale sir bol te hai practice karo practice se hoga....aap ne trick bata ke bohot help kar di...

[@viplovekadre5578]

Aap bhut acche se aur sukoon se pdate hai sir ji , jab tak apki ek video na dekh le din nahi nikalta , thanks for the good work . I am a big fan of your teaching .

[@shubhamshende626]

BST+Preoder given just insert elements in tree as per BST property.

[@amanshitta]

Sir, If we design a BST directly using the preorder like the first element is 30 so the next element will be placed according to the BST property and so on... then the post order can be derived using the tree , So why did we need in-order of the tree? because using the pre-order seq. we get to know what is the root element and also the tree itself is a BST so the next elements will be placed according to the property only

[@riyasathsulthanashaik]

Your teaching levels are really amazing sir.🤩

[@manishyadav7586]

Thanku so much sir ji ..aap sach me great ho..saare concept topic sab clear ho rahe ab 🙏🙏🙏🙏

[@vandanasahu1154]

Sir please make a complete playlist on data structure....it would be of great help

[@sanazamir291]

Great work u have done.. Thanku and stay blessed

[@muhammadhamzamaqsood8576]

That is very concise and complete. Thank you!

[@akshaychougule7170]

Thank you sirji. ... You are best teacher in the world..

[@GateSmashers]

Thank You..Love and blessings

[@naseeblashari2939]

bundle of thanks sir for your such easy and intersting way of teaching

[@hitakshigupta7193]

Okay so let me tell you... You have always been an angel for my engineering final exam to vigorous competitive prepration ❤️

[@Sangeet372]

Your shortcut method are amazing sir 👍👍👍👍👍👍👌👌👌

[@dechuzzyumcity....8300]

Big thanks from Kerala..u r great sir...

[@BATOOL_KHAN123]

Outstanding job 👏❤ really appreciate ❤

[@Nehasutharstatus]

Apki technique bhot. Hi easy muje ab agaya easily me thank you sir 🙏🙏😊😊

[@shwetalitalele9150]

Yr seriously....mindblowing ho sir app.....🙃💃💃

[@Harpreet-e3d]

😊😊😊😊Thanku so much sirrrrr❤❤❤❤❤

[@panktuleaudu2201]

Thanks for this clear explanation sir!

[@kashifmeer2304]

Fun fact :- You can go to next content area by position your 1finger in middle and 2nd finger in skipping place and touch 2 times

[@oanunamdev3505]

Thank you so much 😊 sir

[@tasneempoonawala2701]

Maths me mujhe bohot help milti hai thank u sir😊

[@vishalsaxen]

I really appreciate your skills and presenting skills

[@amityerpude9408]

Jabardast sirji...

[@hafsanisar2453]

Good explanation... Excellent lecture.. Jaza kallah

[@Ali_saif_98]

Maine bht video dekhi...pr smjh ni aaya kuch bhi...finally yha pr im satisfy...thnku guru ji

[@rounak3239]

Gurujee shandhar jabardast zindabad

[@prathamvyas6640]

Bro great work. You easily teach this hard topic ,thank you.

[@stutikandpal480]

Sir, I think there is a simpler method. The preorder traversal is given and also it is given that it is a BST, so we can simple create a BST using the keys, and write its postorder. That we will not have to take care of inorder and preorder simultaneously. we need to do this kind of solution only when it's not mentioned that it is a BST. Please let me know if I am wrong. Thank you.

[@suryaprakashtavva230]

Right bro

[@nilanjandutta_]

G O D ur tricks were soo good watched all ur videos before exam day ........

[@biyankaacharjee5932]

Thank you so much sir ❤️ You are best teacher 💞

[@jamilahmed-z8r]

Thank you clear this concept

[@gauravgangwar317]

thank you sir your videos is more helpful to us thank you......

[@AltuFaltuMandal]

thank you 🙏🏻 sirji ❤

[@Bdlover-24]

Thank you brother 😍😍😍 love for you from Bangladesh

[@soumi6720]

Amazing explanation

[@studyforcomputerscienceand4515]

Mind blowing sir 👍 maza aa gaya sir thanks

[@sadaffnazz725]

thasnks alot sir.outstanding lecture

[@nehashende4790]

Liked, shared, subscribd

[@bilal8286]

Bhai sach m awesome work kr re ho ..hmesha khush rho..love from Pakistan❤

[@krishanudutta2943]

Awesome sir thanks a lot... Happy teacher's day sir God bless you😊❤️

[@suryapratapsinghumath7156]

Awesome teaching skill sir

[@sajansekhu8785]

Superbbbbbbbb.......Waheguru always bless u.....🙏🙏🙏🙏🙏.......⭐⭐⭐⭐⭐

[@manishadeepak2666]

Sir u r truly genius 👍thank u sir🙏🌹🌹

[@vijaykumar-tg2tc]

Solid explaination Sir

[@taleemmurtaza5041]

Sir really you are great amazing trick for find the post order with the hlp of ino and preo😍

[@anusha400]

Very gud teaching sir...Thank you sm😊

[@vipulrawat9844]

amazing explanation

[@AmitKumar-te6hy]

Sir now I am able to find order and also construct tree after watching your video. Can we find out order (in order) if (preorder and post order given to us)?

[@Thecreative734]

Nice explanation sir ❤

[@pratik8332]

Thank you very much sir

[@ajaygenius4644]

Uncomparable explanations sirji🙏

[@dwrbidaimari5345]

Thank you Sir, for your help.

[@salmaKhanum123]

Really helpful thank you sir

[@monikashahane5519]

sir excellent lecture and very useful

[@mpanghal9801]

What an amazing trick😀

[@honey.g791]

VVGood explanation sir

[@samsunglab7593]

great sir

[@shubhampatel7241]

Thanks u sir you are great sir

[@deepikasolankicse5366]

thanks sir

[@juhishivhare2571]

Awesome way of teaching ..😊

[@preetiyadav8140]

Hey sir! Thanks to give us excellent lecture 😊 . Here I need your suggestion is there any particular book to prepare for NIELIT scientific Assistant exam ? Reply Please 🙏

[@kahanimishra9153]

Thank you sir🎉

[@conceptualstudy7196]

Congratulations for 2m subscribers ❤🎉

[@soumambanerjee1816]

Link state routing.. Pe sawal banayiye...

[@divyajain2733]

Thank you sir✌👍

[@ravi12492]

Amazing

[@SaurabhYadav-zn3qt]

Jodddddd..🔥🔥

[@itz_romeo_ff5665]

Thank you sir ji

[@Aishwarya1405-w9m]

Thank you sir😊

[@sameerpatlekar2298]

🔥🔥🔥🔥

[@syedsadiqali892]

Maza agya bhai.. luv u

[@armysongsbyadjarmy3511]

Sir very very thanks 💓💓

[@pratik8332]

Thank you^infinite

[@Satya_ganta]

As those are numbers.. it follows ascending order, if they are alphabets does it follows alphabetical order?

[@nehamehrotra8555]

Great

[@MdAbdullaGaur]

That's great explaining sir 👌👌👌! ❣️

[@meghabisht3225]

Best 💥

[@deepeshshah4961]

Sir, you said that we can create the BST if we know any 2 of the (Inorder/Pre-order/Post-order) but there is PYQ asked in 1987 which says - "For unique tree, Inorder must be present along with any 1 of (Pre-order / Post-order)"

[@leenagardia2425]

Good explanation... thanks

[@amrhosni7175]

I've learned from Indian people more than my colleague that I'm paying for 🇮🇳

[@dipaleescreativerangoli6800]

you are great sir👍

[@Reflexes01]

You are the best 😁❤️

[@Viralshortssvideo]

Option (b ) is same as option (d )

[@Smartstudy20409]

Nyc class

[@HassanKhan-tr5ph]

super sir g.

[@harshavardhankanoj6021]

Thank you 😊

[@ameerabbas5029]

Can we attach 39, on the left of 25, because 39 is greater than 25, which fulfills the filling criteria please

[@jyotikanaik7906]

Sir plz explain that how to draw tree where post order and inorder are given

[@simranpandey6534]

Thankyou sir..🙂

[@palakpatel4557]

Thank you sir

[@priyanshsinha8593]

Sir if the inorder and post order traversal are defined than how will we determine the pre-order of the BST? Please comment and reply and solve my doubt.

[@ghulammurtazagmdahar]

First, using in order and post order draw BST. Second, find pre-order by traversing.

[@aliarubab8761]

Thank u soooo much sir

[@Explore_Sphere]

what if in-order is given in question, then how can we find the root node? because root node is in between the list of numbers? how can we identify?

[@hariomchittara4035]

Nice sir

[@knowledgebhajja2019]

Thanks ❤️

[@Nikhil-Tomar]

Why did we find inorder If we can directly make a bst directly from the preorder data

[@himanshurana5880]

but i have doubt that if inorder given like 1 2 3 4 5 6 7 8 9 and find pre order and post order where 5 will be the root obviously then from left 1 2 3 4 what will be the root ?