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 .
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
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...
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.
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 🙏
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.
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)?
what will happen if a inOrder Traversal is given in ALPHABETS and no increasing/or decreasing order is being followed and you have to answer the preOrder from the given choices?
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)"
It was most confusing question to me but today u provided cheat code to solve it. Sir u r truly genius
Beatiful sir tommorrow i having exams so beautiful
@@poojapoojadhapte1430 multiverse of beauty
Made my concept fully crystal clear
Thanks a lot
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 .
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
Okay so let me tell you... You have always been an angel for my engineering final exam to vigorous competitive prepration ❤️
😊😊😊😊Thanku so much sirrrrr❤❤❤❤❤
Thanku so much sir ji ..aap sach me great ho..saare concept topic sab clear ho rahe ab 🙏🙏🙏🙏
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...
Great work u have done.. Thanku and stay blessed
BST+Preoder given just insert elements in tree as per BST property.
Your teaching levels are really amazing sir.🤩
Thank you sirji. ... You are best teacher in the world..
Thank You..Love and blessings
Big thanks from Kerala..u r great sir...
Sir please make a complete playlist on data structure....it would be of great help
Best teacher ❤ sb clear hogya ppr se ek raat phele 2025 m dekh rha hu apki video
That is very concise and complete. Thank you!
Outstanding job 👏❤ really appreciate ❤
Yr seriously....mindblowing ho sir app.....🙃💃💃
G O D ur tricks were soo good watched all ur videos before exam day ........
I really appreciate your skills and presenting skills
bundle of thanks sir for your such easy and intersting way of teaching
Bhai sach m awesome work kr re ho ..hmesha khush rho..love from Pakistan❤
Apki technique bhot. Hi easy muje ab agaya easily me thank you sir 🙏🙏😊😊
Bro great work. You easily teach this hard topic ,thank you.
Gurujee shandhar jabardast zindabad
Thank you brother 😍😍😍 love for you from Bangladesh
Superbbbbbbbb.......Waheguru always bless u.....🙏🙏🙏🙏🙏.......⭐⭐⭐⭐⭐
Good explanation... Excellent lecture.. Jaza kallah
Your shortcut method are amazing sir 👍👍👍👍👍👍👌👌👌
Jabardast sirji...
Thanks for this clear explanation sir!
Thank you so much sir ❤️
You are best teacher 💞
Maths me mujhe bohot help milti hai thank u sir😊
Thank you so much 😊 sir
Uncomparable explanations sirji🙏
thasnks alot sir.outstanding lecture
Awesome sir thanks a lot... Happy teacher's day sir God bless you😊❤️
thank you sir your videos is more helpful to us thank you......
Maine bht video dekhi...pr smjh ni aaya kuch bhi...finally yha pr im satisfy...thnku guru ji
Very gud teaching sir...Thank you sm😊
Congratulations for 2m subscribers ❤🎉
Mind blowing sir 👍 maza aa gaya sir thanks
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.
Right bro
Sir really you are great amazing trick for find the post order with the hlp of ino and preo😍
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 🙏
Sir u r truly genius 👍thank u sir🙏🌹🌹
Nice explanation sir ❤
That's great explaining sir 👌👌👌! ❣️
You are the best 😁❤️
Awesome teaching skill sir
Thank you clear this concept
Thank you Sir, for your help.
Amazing explanation
What an amazing trick😀
Awesome way of teaching ..😊
Really helpful thank you sir
Solid explaination Sir
amazing explanation
sir excellent lecture and very useful
Thanks u sir you are great sir
Hare Krishna 🧡🩷
Thanks bhaiya
thank you 🙏🏻 sirji ❤
Liked, shared, subscribd
Thank you sir✌👍
Thank you sir🎉
Maza agya bhai.. luv u
Thank you very much sir
Sir very very thanks 💓💓
VVGood explanation sir
Thank you sir😊
Good explanation... thanks
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
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.
First, using in order and post order draw BST.
Second, find pre-order by traversing.
you are great sir👍
great sir
🤕😵🤯its still lil confusing
Jodddddd..🔥🔥
Thank you^infinite
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)?
Best 💥
Thankyou sir..🙂
Link state routing.. Pe sawal banayiye...
Amazing
I've learned from Indian people more than my colleague that I'm paying for 🇮🇳
Thank you 😊
Paper saa aik din pehlaa tyaryy😅 done
thanks sir
what will happen if a inOrder Traversal is given in ALPHABETS and no increasing/or decreasing order is being followed and you have to answer the preOrder from the given choices?
That's the same problem i am having
can someone clear...why he didn't make 39 the right child of 25😢..very confused.
Because 39 is on the right side of the root element 30
As those are numbers.. it follows ascending order, if they are alphabets does it follows alphabetical order?
Thanks ❤️
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)"
super sir g.
2:46
If given question not in number then how we can arrange in ascending or descending order?
Alphabetical order
u are looking gorgeous .....in this outfit😍☺
Sir main ko bharat ratna se samanit karna chahta hu 😊😊😊😊
Thank you sir ji
🔥🔥🔥🔥
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?
Nyc class