Construct Binary Tree from Preorder and Inorder Traversal | Complete Full Tree Data Structure
ฝัง
- เผยแพร่เมื่อ 19 ก.ย. 2024
- This is the video under the series of DATA STRUCTURE & ALGORITHM in a TREE Playlist. We are going to understand How to Construct Binary Tree from Preorder and Inorder Traversal
Join My Telegram channel for more Updates: telegram.me/he...
complete DSA preparation: github.com/Pri...
----------------------------------------------------------------------------------------
► 105. Construct Binary Tree from Preorder and Inorder Traversal
Given two integer arrays preorder and in order where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.
Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
Output: [3,9,20,null,null,15,7]
We also Provide courses on Competitive Programming and Data structure and Algorithms. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------:
Construct Binary Tree from Preorder and Inorder Traversal: leetcode.com/p...
code in This Video: github.com/Pri...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
Telegram► telegram.me/he...
----------------------------------------------------------------------------------------
►Our Playlists on:-
► Tree: • Tree Data Structure & ...
► Hashing: • Hashing Data Structure...
► Matrix: • Matrix (Multidimension...
► STL: • Standard Template Libr...
► Leetcode: • LeetCode Solutions And...
►Competitive Programming: • Full course in Competi...
►C++ Full Course : • C++ full Course in HINDI
►Algorithms: • L-01 || Prefix Sum Arr...
►Data Structure: • Data Structures with C...
------------------------------------------------------------------------
🌟 Please leave a LIKE ❤️ and SUBSCRIBE for more AMAZING content! 🌟
✨ Tags ✨
Construct Binary Tree from Preorder and Inorder Traversal
The tree Data structure in Hindi
Use of Tree Data structure in real Life
question asked in Google
off-campus placement
how to learn to code for beginners
Practice Tree data structure
tree in data structure
Complete course on Tree
Tree in a data structure in Hindi
Tree Full playlist for Beginners
#Tree #Leetcode #programming
Finally completed tree playlist
Ur explanation was the best and easy
And materials with links of code and problems were soo soo helpful
Now i feel like I'm at intermediate level on solving tree problems
Thank you soo much for your diligent efforts means a lot 🤝
Thanks and welcome
Dear Prince vai,
I want to express my sincere gratitude to you for creating the incredible playlist on tree data structures. (As a Bangladeshi, Hindi is not my native language, but I understood your entire playlist with ease). Your clear explanations and organized content made it possible for me to grasp the concepts of tree data structures. Once again, thank you for sharing your knowledge and expertise.
After 5 days of consistency finally i have comlpleted
your Tree playlist .
Atlast i wannaa say to you that the
way of your teaching is so good .
many one is teaching on this platform but none one can match you
thanks to bring this type of playlist.
All the best
Playlist complete ho gayi bhaiya...kaafi confidence aya. Ab bus har video ke code dubara se practise karna hai.
maja aa gya bhaiya ... baaki kisi aur ka playlist se smajah nahi aya but aapse sab samajh mai aya 😇
waooo bro ... bhut mehnat kiya aapne bro good work
i think i got addicted to your way of teaching
because i have started your video on wacthing from graph playlist ,
but when i give a time to 2-3 videos of graph then i decided to cover all playlist of graph.
i will succesfull in my way.
but journey didnt stops here
today is the day where i covered all videos of your playlist which is
Graph, Sorting,STL,Heap,Hashing AND Tree...........
i have always issue in non linear data structure after covering these playlist
i am feeling much confident !!!!thanks bhaiyaa 😶
Hahaha
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
I rarely do comments... but this channel has my heart.. jo code kahi smjh ni ata vo yha easy lgta h ... keep going sir and many thanks to you :)
Waooo thanks for this love and support
this is the best video i have ever found on this platform
Amazing explanation. Thank you
You are welcome!
Kaaafi achii explaination hai....Great contribution towards education
Thanks a lot brother
Thodi takleef hui par yeh try karke accha laga ,thanks
Are bhai ...bhut Sahi 🔥🔥
the best explanation on planet earth
Finally completed tree playlist
Thanks Prince Bhaiya❤
Best explanation
Super helpful. Best video on this topic . Very easy to understand.
Glad it was helpful!
Prince bhai apki health acchi rhe h
Aur aisi hi aap explain krte rhe
Thanks a lot buddy ❤️
Finally completed this series today🤟 thanks Buddy 🙃
Enjoy!
Thank you Brother🧡😇 really Superb explanation.......
Keep uploading these kind of videos.
Thank you, I will
at the end of the video pls mention the time complexity as it became an imp aspect of interview to code in the most optimized way
Excellent teaching skills.. one doubt why binary search tree is not covered?
koi ye btado ki hamne preindex ko globally kyu declare kra hai
same doubt have you got the solution?
We have globally defined it because we want to access the Preorder vector elements in sequence, if we do not define it globally then due to recursion calls our PreIndex value can get changed and the sequence would get disturbed
Thanku :)
Your welcome dost
Thank you Bhaiya
welcome buddy
explanation good!!!
Thanks a lot
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
Thank you, bhaiya
You're welcome 😊
even i buys paid batch but your tree lecture is smazing
Thanks a lot yaar
instead of looping in inorder array every time we can create a hashmap of [ Inorder[index] , index ] so that we get the index of that element in constant time .
yes bro u can do that as well
can u please write down your code in the comment section of this video so that others can also understood
sir please 1 video AVL tree pa banado with implementation using C
As soon as possible
bhaiya pura dry karwana tha ye part (2,4) . mujhe jaha doubt aa raha tha vahi clear nahi ho paya
Prince bhai Tree k Baad Graph please 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
Definitely sure 😍😍
bhai postorder ar inorder ka kaise kra ye to bta do'
same method hoga yaar, bass thora sa looping alag trah se hoga postorder me Node last me hoga so start waha se karenge ...try and figure it out by yourself samhj me aa jayega
bhaiya tree kr or kitne question ayiage
Ab sayad end hai...aap graph start karlo
Most probably 1-3 questions aur aayega
Complete dry run to kr lete 🤦🏻♀️🤦🏻♀️
bhi ajaan ka vakat video shoot mat kro plases
Sorry bro 😅
@@HelloWorldbyprince koy nhi bhi 💝😊