Тёмный

Tree traversal algorithms (BFS and DFS - Preorder, Inorder, Postorder) 

CodeBeauty
Подписаться 277 тыс.
Просмотров 58 тыс.
50% 1

📚 Learn how to solve problems and build projects with these Free E-Books ⬇️
C++ Lambdas e-book - free download here: bit.ly/freeCppE-Book
Entire Object-Pascal step-by-step guide - free download here: bit.ly/FreeObjectPascalEbook
🚀📈💻🔥 My Practical Programming Course: www.codebeautyacademy.com/
Experience the power of practical learning, gain career-ready skills, and start building real applications!
This is a step-by-step course designed to take you from beginner to expert in no time!
💰 Here is a coupon to save 10% on your first payment (CODEBEAUTY_YT10).
Use it quickly, because it will be available for a limited time.
Download Visual Assist here: bit.ly/WT-CB
I use it to enhance the performance, features, and support for C, C#, and C++ development in Visual Studio.
Download Ultra Edit here: bit.ly/UE-CB
It is a powerful, secure text editor designed specifically for programmers.
☕ If you've found my content helpful and would like to support me, you now have the option to buy me a coffee or a cookie! It's a small gesture of gratitude that means a lot to me and helps me keep creating free educational videos for you. You can use the link below to make a contribution: bit.ly/CodeBeauty_BuyMeACoffee
However, please don't feel obligated to do so. I appreciate every one of you, and I will continue to share valuable content with you regardless of whether you choose to support me in this way. Thank you for being part of the Code Beauty community! ❤️😇
Trees are an important data structure because of their non-linear nature, which allows for a faster response time during a search process. So in this video, I decided to teach you about the most important algorithms and ways to search and traverse a binary tree.
After watching the video you'll learn and understand the differences between BFS (breadth-first search) and DFS (depth-first search) algorithms, and also learn everything you need to know about Preorder, Inorder, and Postorder algorithms.
Tree data structure part 1 (introduction): • Tree data structure - ...
Learn about Recursive functions: • C++ FUNCTIONS (2020) -...
Contents:
00:00 - Introduction
02:38 - BFS and DFS
04:32 - Preorder algorithm
08:38 - Traversing a tree with recursion (explaining the code)
15:34 - Inorder algorithm
19:49 - Postorder algorithm
Find more Data Structures tutorials here: bit.ly/Cpp_DataStructures
Follow me on other platforms:
Instagram 📸 - / truecodebeauty
Twitter 🐦- / truecodebeauty

Наука

Опубликовано:

 

3 июл 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 142   
@CodeBeauty
@CodeBeauty 2 года назад
📚 Learn how to solve problems and build projects with these FREE E-Books ⬇️ C++ Lambdas e-book - free download here: bit.ly/freeCppE-Book Entire Object-Pascal step-by-step guide - free download here: bit.ly/FreeObjectPascalEbook 🚀📈💻🔥 My Practical Programming Course: www.codebeautyacademy.com/ Experience the power of practical learning, gain career-ready skills, and start building real applications! This is a step-by-step course designed to take you from beginner to expert in no time! 💰 Here is a coupon to save 10% on your first payment (CODEBEAUTY_YT10). Use it quickly, because it will be available for a limited time. Code from this video: #include using namespace std; struct Node { int data; Node* left; Node* right; }; Node* createNode(int data) { Node* newNode = new Node(); newNode->data = data; newNode->left = newNode->right = nullptr; return newNode; } void printTree(Node* root) { if (root == nullptr) return; //preorder algorithm (D,L,R) cout data left); printTree(root->right); } int main() { //Level 1 Node* root = createNode(1); //Level 2 root->left = createNode(2); root->right = createNode(3); //Level 3 root->left->left = createNode(4); root->left->right = createNode(5); root->right->left = createNode(6); root->right->right = createNode(7); //Level 4 root->left->right->left = createNode(9); root->right->right->left = createNode(15); printTree(root); cin.get(); }
@jenyak8083
@jenyak8083 2 года назад
You very beautiful im afraid that if i will watch to much your videos i will fall in love😂😂
@interestingmusic9578
@interestingmusic9578 Год назад
.
@md.abubakkarsiddiq1156
@md.abubakkarsiddiq1156 Год назад
4,9,5,2,6,15,7,3,1 is the post order traversal. Is this the correct answer, please let me know.
@emmanuelnsiah8036
@emmanuelnsiah8036 3 месяца назад
yes this is right
@graymatter1426
@graymatter1426 2 года назад
Your video lessons are so helpful for my coding journey. The things which are hard to understand in textbook is easy to follow on your tutorial. Thanks for your amazing work ❤️
@javiercantoy7522
@javiercantoy7522 2 года назад
You explain very well 😉
@dundyd3612
@dundyd3612 2 года назад
Amazing video! I can't explain how long I've been looing for a good explanation, glad I finally found it.
@I_am_FRANCO
@I_am_FRANCO 2 месяца назад
Thanks mrs. puff for the vid
@khusanumarov5834
@khusanumarov5834 2 года назад
Cool! Very simple explaining. Thank you so much!!!
@user-eg7wk9ui2o
@user-eg7wk9ui2o 2 года назад
Hello. It is the best explanation I've ever seen. Thank you for your lessons
@CodeBeauty
@CodeBeauty 2 года назад
I'm glad to hear that and happy to help 😃😃
@marym9003
@marym9003 2 года назад
These books are amazing, thanks for sharing free resources with us Saldina ❤️
@Daniel-um9ye
@Daniel-um9ye Год назад
You managed to make this look super easy. The best traversing trees tutorial I have seen ( and I have seen a lot of them ).
@GMTX-qj8or
@GMTX-qj8or 2 года назад
Thank you for a great paced and visual explanation of the topic, keep up the great work, the e-books are great.
@howabadworld
@howabadworld 2 года назад
nice video!
@CodeBeauty
@CodeBeauty 2 года назад
Thanks 🥰
@IndieGamer95
@IndieGamer95 2 года назад
I wanna learn
@CodeBeauty
@CodeBeauty 2 года назад
Go ahead 😃😃
@adammed8667
@adammed8667 2 года назад
Very refreshing video... keep the good work up.
@charleswayne5581
@charleswayne5581 Месяц назад
This is the most excellent explanation on recursion I have ever seen!
@CodeBeauty
@CodeBeauty Месяц назад
I'm glad that you like it 🤗 🥰
@farbolos3164
@farbolos3164 2 года назад
Hi, this channel is pure gold, is understandable even for an italian like me. Thank you very much.
@029_shauryaagarwal8
@029_shauryaagarwal8 2 года назад
My placement session is coming, can you make more such videos on Data structures and algorithms, your explanations are very good🔥❤️
@dangerbirb4981
@dangerbirb4981 Год назад
This is the clearest explanation of DFS algorithms that I've seen. Thank you for making it easy (where my book and lecturer did not)!
@montyGator
@montyGator Год назад
Omg! I have never understood how a recursive function works until I watched this video! Your explanations are top notch!
@peterchisangamwamba9100
@peterchisangamwamba9100 2 года назад
since you're learning algorithms like the video it helps youtube algorithms CLASSIC!!
@muneeburrehman4690
@muneeburrehman4690 2 года назад
A good revision session (been ages!) Thank you Ma'am!
@HiMiss940
@HiMiss940 4 месяца назад
Your English is really good , i mean really easy to understand, good Word Choice ❤❤😊
@thinkandcreate5633
@thinkandcreate5633 2 года назад
This is the best explanation. Thank you soooooo much!!!
@phantomghoul2846
@phantomghoul2846 Год назад
back at it with the bangers I really thank you for this!
@azixkhan6632
@azixkhan6632 Год назад
//Postorder algorithm (L,R,D) printTree(root->left); printTree(root->right); cout data
@kf4547
@kf4547 Год назад
Such a great explanation of the themes! Thank u very much, we appreciate your work
@hulkio22
@hulkio22 4 месяца назад
AWESOME explanation!!!. Thanks a lot!!!
@itsme17717
@itsme17717 7 месяцев назад
you are awesome, I really understand trees right now
@jliu7221
@jliu7221 10 месяцев назад
Better explained than those tedious and never-ending college CS courses. I enjoy your instructions. Simply Amazing!
@johnniewalkerjohnniewalker2459
@johnniewalkerjohnniewalker2459 2 года назад
very comprehensive video Saldina.Your english also are awesome.Can you make if you find free time more video about windows forms applications?
@deli5777
@deli5777 Год назад
Maybe the most helpful video on recursion that I've seen
@Pirzade
@Pirzade 18 дней назад
One word is enough : Incredible.
@filipetaveiros6967
@filipetaveiros6967 2 года назад
Excellent explanation!
@munib2023
@munib2023 Месяц назад
Upload all your STL videos in a single video as you did in C++. This will helped us alot.
@AryanSingh-6699
@AryanSingh-6699 2 года назад
❤ Love from India 🧡🤍💚
@CodeBeauty
@CodeBeauty 2 года назад
Love for India 🧡🤍💚
@TheDima23
@TheDima23 Год назад
Amazing video, thank you so much for this !
@wrkrebel
@wrkrebel Год назад
very easy to understand. thanks for making such useful videos
@Shinji91
@Shinji91 Год назад
This helps so much. Thank you!
@tofiq62
@tofiq62 Год назад
Very good explanation! 👏
@Programming_Buddy1
@Programming_Buddy1 2 года назад
Love your videos!
@Tech_Diaries_With_Vincent
@Tech_Diaries_With_Vincent 23 дня назад
Thank you for this video, you made this topic and concept more understandable 😍
@CodeBeauty
@CodeBeauty 23 дня назад
You're welcome 😊 🥰
@putin_navsegda6487
@putin_navsegda6487 9 месяцев назад
Wow great explanation ! Finally i understand it😁
@nika_nothingmore
@nika_nothingmore 9 месяцев назад
your videos are amazing!
@alaeddinebenider205
@alaeddinebenider205 Год назад
your video are so helpful
@uwebosse262
@uwebosse262 2 года назад
perfect Explanation!
@madhusankawijerathne8435
@madhusankawijerathne8435 10 месяцев назад
Really helpful. Thank you!
@user-xu9by3uh4u
@user-xu9by3uh4u 2 года назад
Excellent video!! Could you update more algorithm-related Videos in the future? Your explanation is simple and good to understand.
@kwizeraenock1639
@kwizeraenock1639 10 месяцев назад
Thank you saldina for your help ❤
@startengine8838
@startengine8838 2 года назад
keep up the good work super useful
@anjanaimesh3258
@anjanaimesh3258 2 месяца назад
Great explanation. God bless you 🙏
@YaXiao-wv4rm
@YaXiao-wv4rm 3 месяца назад
What you said is great!
@Zita098765
@Zita098765 2 года назад
Thank you so much! Please please make a video of BFS!
@Marzex1x
@Marzex1x 2 месяца назад
Thank you!
@ismailyousfi3521
@ismailyousfi3521 2 года назад
Thenk you I learn a lot from you.
@noahgoss5552
@noahgoss5552 2 года назад
Hi Saldina! Amazing video :D I was wondering if in the future if you give a tutorial on vectors in C++? Most of the tutorials I looked up are a bit confusing and I feel like you can give some o fun clarity on this topic like you do with your other videos.
@prakharposwal9
@prakharposwal9 2 года назад
Plz make video for B-tree 🙏🙏
@quyettranvan6506
@quyettranvan6506 2 года назад
Many thanks for your explanations. Hope you to make a video about hash table soon.
@madhusankawijerathne8435
@madhusankawijerathne8435 10 месяцев назад
Thank you again
@vincent_muriithi
@vincent_muriithi 23 дня назад
amazing, kindly create a BFS traversal algorithm video 😍
@uanbu6539
@uanbu6539 Год назад
Thank you for this video. You are a really good teacher. Please make a video about BFS as well 🙏
@CodeBeauty
@CodeBeauty Год назад
Great suggestion! :D
@SatishSingh-cp3wo
@SatishSingh-cp3wo Год назад
The way you explain, even a 5th grader will understand. 🤜🤛
@user-ft3tl2rd6f
@user-ft3tl2rd6f 2 года назад
Hello, Saldina! I am a Russian developer. Your videos are amazing! You explain the topic very clearly, giving examples from life! Looking forward to your new videos!
@I_am_FRANCO
@I_am_FRANCO 2 месяца назад
Я люблю Россию
@Pirzade
@Pirzade 18 дней назад
I want to add something. There are 6 possibilities for Depth First Search Algorithm according to the starting point in data structure. D refers to the Data, L refers to the Left, R refers to the Right pointer. The possibilities are; A-PreOrder (1-DLR, 2-DRL), B-InOrder (3-LDR, 4-RDL), C-PostOrder (5-LRD, 6-RLD)
@Avolua
@Avolua 2 года назад
Gosh! Just in time!!!!
@danonuevo
@danonuevo Год назад
Hello, thank you so much, and it's a very concise explanation for the DFS. May we request how about doing BFS with the same Tree example. More tutorial videos to come.
@hosamessa9069
@hosamessa9069 2 года назад
you're a life saver 😘😘
@CodeBeauty
@CodeBeauty 2 года назад
🤞😁
@qaiserakram241
@qaiserakram241 2 года назад
I saw u an year ago U have changed alot😳
@alexanderlord1512
@alexanderlord1512 2 года назад
Thank you saldina I hope you make vedio's about problem solving
@mr.potato8894
@mr.potato8894 2 года назад
Is it possible to get a virtual autograph? 😂😂
@dundyd3612
@dundyd3612 2 года назад
Hahahha, I was wondering the same :D
@CodeBeauty
@CodeBeauty 2 года назад
Hahaha, something like my digital signature 😁 Maybe I'll make a few NFTs in the future and share them with my most active viewers 🤔😃
@Mzkysti
@Mzkysti 2 года назад
@@CodeBeauty this video is definitely worth of a coffee at least, I'll check how that works...
@handover007
@handover007 Месяц назад
You teaches so nicely , your lectures sounds like music.
@CodeBeauty
@CodeBeauty Месяц назад
I'm happy to hear that 🥰
@bishoyzakhary3531
@bishoyzakhary3531 Год назад
amazing video I finally understand DFS ❤ ; can I ask you to make a video explaining BFS and red and black tree thank you
@sononsoft5253
@sononsoft5253 Год назад
The hardest thing about coding is not seeing what it does in the background. Your explanation is amazing and this is what people hope to see, especially me. Thank you so much!
@saiganeshmanda4904
@saiganeshmanda4904 Год назад
Waiting for a video on BFS algorithm.... :))
@alexanderlord1512
@alexanderlord1512 2 года назад
Thank you for this vedio but i wish you make vedios about solve problems using dfs I couldn't solve any problem until now using it
@nikshepkulli
@nikshepkulli 4 месяца назад
great video, everything was understood so easily! can I get link for BFS?
@MaySmithereen
@MaySmithereen 2 года назад
Please also do the breadth first search :)
@willofirony
@willofirony 2 года назад
Explaining recursive functions is challenging and often confusing to the neophyte. Nevertheless, you tackled the challenge faultlessly. One wonders if, when searching, the algorithms would be more efficient if one compared the 'target' with the data and choosing the appropriate algorithm on the result. Are there generic algorithms for balancing the tree, should one side of a node gets much 'heavier' than the other?
@ookhands3843
@ookhands3843 Год назад
Hi, thanks for your explanation. I have questions about types of Trees and how they are used. Black-Red Tree for example. Or in which case we use DFS ? Thanks.
@shinoke9395
@shinoke9395 2 года назад
can you setup tour also i kinda waana know and thanks for the hard work....
@sarwat3552
@sarwat3552 2 года назад
Please upload more videos on tree, if you have any paid courses please embed the link in the description
@spurti
@spurti 10 месяцев назад
BFS please!
@omerhusen906
@omerhusen906 Год назад
can you make more such videos on Data structures and algorithms? your explanations are very nice,and you are so beautyfull hhhh. thanks for you.
@ishaankhatter6384
@ishaankhatter6384 Год назад
Hey, Can you please post more videos of data structures?
@ASHWANIKUMAR-fc5pu
@ASHWANIKUMAR-fc5pu 2 года назад
kindly add more videos
@mariacunha8508
@mariacunha8508 Год назад
This video was SO helpful! I was struggling with this topic but it was so easy and simple to understand with you! Really appreciate you!
@mihnea-um5gy
@mihnea-um5gy Год назад
Will you do a video for BST?
@norioimada2172
@norioimada2172 2 года назад
Could you show me the BFS algorithm as well?
@d_113d
@d_113d 2 года назад
❤️❤️❤️
@sononsoft5253
@sononsoft5253 Год назад
Do you have the video for BFS?
@user-lh6xt5ut5f
@user-lh6xt5ut5f 8 месяцев назад
please make graph algorithm video
@hbm293
@hbm293 2 года назад
Hope everything is fine for you, following the earthquake in Stolac today!
@CodeBeauty
@CodeBeauty 2 года назад
It was scary. Everything is fine with my family and all the people I know, but I read that there were some casualties. I hope that everything is okay with you, and I also hope that there will be no more earthquakes, because from what I read, a couple of them usually hits one after the other. That would be terrible 😰
@danielmartnutriologous
@danielmartnutriologous 2 года назад
I love you videos thank you for share you knowledge question do you have Patrion ?
@CodeBeauty
@CodeBeauty 2 года назад
I don't have Patreon, maybe in the future, currently I only have BuyMeACoffee 😊😃☕
@user-sd7im6rd5h
@user-sd7im6rd5h Год назад
Hi i am trying to find how to deletion form Tree
@097_suryakantdhote9
@097_suryakantdhote9 2 года назад
Will you be doing a video on hash maps?
@mehdi-vl5nn
@mehdi-vl5nn 2 года назад
is any difference between traversal and lookup ?
@adanzavala4801
@adanzavala4801 2 года назад
From a brown-skinned Mexican, i say thanks, these videos of yours are absolutely BRILLIANT! They are helping me in my engineering classes, so again, thanks.
@jamalparker4487
@jamalparker4487 Год назад
How does the algorithm know to go back up a node after reaching a node with no left or right linked node?
@danialsaud3189
@danialsaud3189 2 года назад
Iwanted to ask Where to learn about functions in headers file for c++ ?
@ilham-t9y
@ilham-t9y Год назад
11:56 how do the program know that the root is passed to the next node?
@user-xg7hi5mh3g
@user-xg7hi5mh3g Год назад
I ve a struct of student with some properties : code is the identifier of the student, it will be the node in the binary search tree , first i would like to create a linked list of int from this struct ?? And then convert this linked list to a bst in a dynamic way? Please help
@krishnagamerz2075
@krishnagamerz2075 2 года назад
I will have to make a search engine. please tell me road map mam.
Далее
😍😂❤️ #shorts
00:12
Просмотров 1 млн
8 patterns to solve 80% Leetcode problems
7:30
Просмотров 216 тыс.
Learn Tree traversal in 3 minutes 🧗
3:56
Просмотров 85 тыс.
Binary tree traversal: Preorder, Inorder, Postorder
14:29
Кто производит iPhone?
0:59
Просмотров 465 тыс.
iPhone перегрелся, что делать?!
1:01