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

[@CodeBeauty]

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

You very beautiful im afraid that if i will watch to much your videos i will fall in love😂😂

[@Interestingrabbit]

.

[@dundyd3612]

Amazing video! I can't explain how long I've been looing for a good explanation, glad I finally found it.

[@I_am_FRANCO]

Thanks mrs. puff for the vid

[@graymatter1426]

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 ❤️

[@МаксСивухо]

Hello. It is the best explanation I've ever seen. Thank you for your lessons

[@CodeBeauty]

I'm glad to hear that and happy to help 😃😃

[@farbolos3164]

Hi, this channel is pure gold, is understandable even for an italian like me. Thank you very much.

[@javiercantoy7522]

You explain very well 😉

[@khusanumarov5834]

Cool! Very simple explaining. Thank you so much!!!

[@GMTX-qj8or]

Thank you for a great paced and visual explanation of the topic, keep up the great work, the e-books are great.

[@peterchisangamwamba9100]

since you're learning algorithms like the video it helps youtube algorithms CLASSIC!!

[@marym9003]

These books are amazing, thanks for sharing free resources with us Saldina ❤️

[@adammed8667]

Very refreshing video... keep the good work up.

[@jliu7221]

Better explained than those tedious and never-ending college CS courses. I enjoy your instructions. Simply Amazing!

[@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 ).

[@montyGator]

Omg! I have never understood how a recursive function works until I watched this video! Your explanations are top notch!

[@jchdbtcmdddhuryy6332]

Your code is so clean and readable. THANK , Miss🥰.

[@azixkhan6632]

//Postorder algorithm (L,R,D) printTree(root->left); printTree(root->right); cout data

[@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)!

[@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]

yes this is right

[@johnniewalkerjohnniewalker2459]

very comprehensive video Saldina.Your english also are awesome.Can you make if you find free time more video about windows forms applications?

[@charleswayne5581]

This is the most excellent explanation on recursion I have ever seen!

[@CodeBeauty]

I'm glad that you like it 🤗 🥰

[@deli5777]

Maybe the most helpful video on recursion that I've seen

[@AryanSingh-6699]

❤ Love from India 🧡🤍💚

[@CodeBeauty]

Love for India 🧡🤍💚

[@029_shauryaagarwal8]

My placement session is coming, can you make more such videos on Data structures and algorithms, your explanations are very good🔥❤️

[@howabadworld]

nice video!

[@CodeBeauty]

Thanks 🥰

[@Tech_Diaries_With_Vincent]

Thank you for this video, you made this topic and concept more understandable 😍

[@CodeBeauty]

You're welcome 😊 🥰

[@МаксимУдовиченко-и1м]

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]

Я люблю Россию

[@thinkandcreate5633]

This is the best explanation. Thank you soooooo much!!!

[@HiMiss940]

Your English is really good , i mean really easy to understand, good Word Choice ❤❤😊

[@phantomghoul2846]

back at it with the bangers I really thank you for this!

[@itsme17717]

you are awesome, I really understand trees right now

[@munib2023]

Upload all your STL videos in a single video as you did in C++. This will helped us alot.

[@潘建廷-g3o]

Excellent video!! Could you update more algorithm-related Videos in the future? Your explanation is simple and good to understand.

[@muneeburrehman4690]

A good revision session (been ages!) Thank you Ma'am!

[@kf4547]

Such a great explanation of the themes! Thank u very much, we appreciate your work

[@hulkio22]

AWESOME explanation!!!. Thanks a lot!!!

[@Pirzade]

One word is enough : Incredible.

[@uanbu6539]

Thank you for this video. You are a really good teacher. Please make a video about BFS as well 🙏

[@CodeBeauty]

Great suggestion! :D

[@IndieGamer95]

I wanna learn

[@CodeBeauty]

Go ahead 😃😃

[@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!

[@prakharposwal9]

Plz make video for B-tree 🙏🙏

[@TheDima23]

Amazing video, thank you so much for this !

[@anjanaimesh3258]

Great explanation. God bless you 🙏

[@HaHaiCuongK18HCM]

it is truely code beauty for many reason

[@CodeBeauty]

thank you, did you check my C# Practical Programming Course at www.codebeautyacademy.com ??

[@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!

[@wrkrebel]

very easy to understand. thanks for making such useful videos

[@filipetaveiros6967]

Excellent explanation!

[@putin_navsegda6487]

Wow great explanation ! Finally i understand it😁

[@noahgoss5552]

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.

[@SatishSingh-cp3wo]

The way you explain, even a 5th grader will understand. 🤜🤛

[@Zita098765]

Thank you so much! Please please make a video of BFS!

[@vincent_muriithi]

amazing, kindly create a BFS traversal algorithm video 😍

[@alaeddinebenider205]

your video are so helpful

[@adanzavala4801]

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.

[@Pirzade]

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)

[@quyettranvan6506]

Many thanks for your explanations. Hope you to make a video about hash table soon.

[@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.

[@ismailyousfi3521]

Thenk you I learn a lot from you.

[@kwizeraenock1639]

Thank you saldina for your help ❤

[@tofiq62]

Very good explanation! 👏

[@Data_Science_In_Kannada]

great video, everything was understood so easily! can I get link for BFS?

[@YaXiao-wv4rm]

What you said is great!

[@Shinji91]

This helps so much. Thank you!

[@madhusankawijerathne8435]

Really helpful. Thank you!

[@qaiserakram241]

I saw u an year ago U have changed alot😳

[@pauldvora]

Could you be so kind and make that bfs video too? I mean I know how to implement it, but with your explanations that would be just amazing.

[@nika_nothingmore]

your videos are amazing!

[@Mosiddiq-o3v]

Love from Egypt 💌

[@Marzex1x]

Thank you!

[@willofirony]

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?

[@shinoke9395]

can you setup tour also i kinda waana know and thanks for the hard work....

[@uwebosse262]

perfect Explanation!

[@madhusankawijerathne8435]

Thank you again

[@bishoyzakhary3531]

amazing video I finally understand DFS ❤ ; can I ask you to make a video explaining BFS and red and black tree thank you

[@HarryNgKokJing]

Can you make a video on DFS tree traversal via iteration?

[@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.

[@sarwat3552]

Please upload more videos on tree, if you have any paid courses please embed the link in the description

[@alexanderlord1512]

Thank you saldina I hope you make vedio's about problem solving

[@Programming_Buddy1]

Love your videos!

[@hosamessa9069]

you're a life saver 😘😘

[@CodeBeauty]

🤞😁

[@mr.potato8894]

Is it possible to get a virtual autograph? 😂😂

[@dundyd3612]

Hahahha, I was wondering the same :D

[@CodeBeauty]

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]

@@CodeBeauty this video is definitely worth of a coffee at least, I'll check how that works...

[@alexanderlord1512]

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

[@mihnea-um5gy]

Will you do a video for BST?

[@MuhammadBilal-j9x]

Hi i am trying to find how to deletion form Tree

[@SaiGanesh314]

Waiting for a video on BFS algorithm.... :))

[@norioimada2172]

Could you show me the BFS algorithm as well?

[@startengine8838]

keep up the good work super useful

[@ilham-t9y]

11:56 how do the program know that the root is passed to the next node?

[@OmarAbdulmajeed]

what i must study after this?Decision Tree Algorithm?????

[@jamalparker4487]

How does the algorithm know to go back up a node after reaching a node with no left or right linked node?

[@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.

[@handover007]

You teaches so nicely , your lectures sounds like music.

[@CodeBeauty]

I'm happy to hear that 🥰

[@abraarz2971]

Thank you!

[@انامسلموكفى]

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

[@MaySmithereen]

Please also do the breadth first search :)

[@Avolua]

Gosh! Just in time!!!!

[@hbm293]

Hope everything is fine for you, following the earthquake in Stolac today!

[@CodeBeauty]

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 😰

[@veslyju1984]

At the part printTree(Node* root){} printTree(root); why there is no pointer to pointer like insert in linkedlist? Like printTree(Node** root){} printTree(&root); I mean like this ,isn't root point to other ?

[@spurti]

BFS please!

[@sononsoft5253]

Do you have the video for BFS?

[@ishaankhatter6384]

Hey, Can you please post more videos of data structures?