📚 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(); }
@jenyak80832 жыл бұрын
You very beautiful im afraid that if i will watch to much your videos i will fall in love😂😂
@interestingmusic9578 Жыл бұрын
.
@graymatter14262 жыл бұрын
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 ❤️
@dundyd36122 жыл бұрын
Amazing video! I can't explain how long I've been looing for a good explanation, glad I finally found it.
@I_am_FRANCO5 ай бұрын
Thanks mrs. puff for the vid
@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.
@emmanuelnsiah80366 ай бұрын
yes this is right
@МаксСивухо2 жыл бұрын
Hello. It is the best explanation I've ever seen. Thank you for your lessons
@CodeBeauty2 жыл бұрын
I'm glad to hear that and happy to help 😃😃
@khusanumarov58342 жыл бұрын
Cool! Very simple explaining. Thank you so much!!!
@farbolos31642 жыл бұрын
Hi, this channel is pure gold, is understandable even for an italian like me. Thank you very much.
@marym90032 жыл бұрын
These books are amazing, thanks for sharing free resources with us Saldina ❤️
@GMTX-qj8or2 жыл бұрын
Thank you for a great paced and visual explanation of the topic, keep up the great work, the e-books are great.
@AryanSingh-66992 жыл бұрын
❤ Love from India 🧡🤍💚
@CodeBeauty2 жыл бұрын
Love for India 🧡🤍💚
@029_shauryaagarwal82 жыл бұрын
My placement session is coming, can you make more such videos on Data structures and algorithms, your explanations are very good🔥❤️
@javiercantoy75222 жыл бұрын
You explain very well 😉
@peterchisangamwamba91002 жыл бұрын
since you're learning algorithms like the video it helps youtube algorithms CLASSIC!!
@jliu7221 Жыл бұрын
Better explained than those tedious and never-ending college CS courses. I enjoy your instructions. Simply Amazing!
@azixkhan66322 жыл бұрын
//Postorder algorithm (L,R,D) printTree(root->left); printTree(root->right); cout data
@johnniewalkerjohnniewalker24592 жыл бұрын
very comprehensive video Saldina.Your english also are awesome.Can you make if you find free time more video about windows forms applications?
@Daniel-um9ye2 жыл бұрын
You managed to make this look super easy. The best traversing trees tutorial I have seen ( and I have seen a lot of them ).
@dangerbirb49812 жыл бұрын
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)!
@montyGator2 жыл бұрын
Omg! I have never understood how a recursive function works until I watched this video! Your explanations are top notch!
@charleswayne55815 ай бұрын
This is the most excellent explanation on recursion I have ever seen!
@CodeBeauty5 ай бұрын
I'm glad that you like it 🤗 🥰
@adammed86672 жыл бұрын
Very refreshing video... keep the good work up.
@deli5777 Жыл бұрын
Maybe the most helpful video on recursion that I've seen
@潘建廷-g3o2 жыл бұрын
Excellent video!! Could you update more algorithm-related Videos in the future? Your explanation is simple and good to understand.
@howabadworld2 жыл бұрын
nice video!
@CodeBeauty2 жыл бұрын
Thanks 🥰
@МаксимУдовиченко-и1м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_FRANCO5 ай бұрын
Я люблю Россию
@munib20235 ай бұрын
Upload all your STL videos in a single video as you did in C++. This will helped us alot.
@Pirzade4 ай бұрын
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)
@noahgoss55522 жыл бұрын
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.
@Pirzade4 ай бұрын
One word is enough : Incredible.
@Tech_Diaries_With_Vincent4 ай бұрын
Thank you for this video, you made this topic and concept more understandable 😍
@CodeBeauty4 ай бұрын
You're welcome 😊 🥰
@HiMiss9408 ай бұрын
Your English is really good , i mean really easy to understand, good Word Choice ❤❤😊
@IndieGamer952 жыл бұрын
I wanna learn
@CodeBeauty2 жыл бұрын
Go ahead 😃😃
@Data_Science_In_Kannada8 ай бұрын
great video, everything was understood so easily! can I get link for BFS?
@hulkio228 ай бұрын
AWESOME explanation!!!. Thanks a lot!!!
@uanbu6539 Жыл бұрын
Thank you for this video. You are a really good teacher. Please make a video about BFS as well 🙏
@CodeBeauty Жыл бұрын
Great suggestion! :D
@prakharposwal92 жыл бұрын
Plz make video for B-tree 🙏🙏
@SatishSingh-cp3wo Жыл бұрын
The way you explain, even a 5th grader will understand. 🤜🤛
@thinkandcreate56332 жыл бұрын
This is the best explanation. Thank you soooooo much!!!
@kf4547 Жыл бұрын
Such a great explanation of the themes! Thank u very much, we appreciate your work
@muneeburrehman46902 жыл бұрын
A good revision session (been ages!) Thank you Ma'am!
@anjanaimesh32586 ай бұрын
Great explanation. God bless you 🙏
@itsme1771711 ай бұрын
you are awesome, I really understand trees right now
@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.
@vincent_muriithi4 ай бұрын
amazing, kindly create a BFS traversal algorithm video 😍
@willofirony2 жыл бұрын
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?
@Zita0987652 жыл бұрын
Thank you so much! Please please make a video of BFS!
@alaeddinebenider205 Жыл бұрын
your video are so helpful
@TheDima23 Жыл бұрын
Amazing video, thank you so much for this !
@HaHaiCuongK18HCMАй бұрын
it is truely code beauty for many reason
@CodeBeauty28 күн бұрын
thank you, did you check my C# Practical Programming Course at www.codebeautyacademy.com ??
@quyettranvan65062 жыл бұрын
Many thanks for your explanations. Hope you to make a video about hash table soon.
@phantomghoul28462 жыл бұрын
back at it with the bangers I really thank you for this!
@YaXiao-wv4rm6 ай бұрын
What you said is great!
@wrkrebel2 жыл бұрын
very easy to understand. thanks for making such useful videos
@ookhands38432 жыл бұрын
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.
@filipetaveiros69672 жыл бұрын
Excellent explanation!
@putin_navsegda6487 Жыл бұрын
Wow great explanation ! Finally i understand it😁
@mihnea-um5gy Жыл бұрын
Will you do a video for BST?
@sarwat35522 жыл бұрын
Please upload more videos on tree, if you have any paid courses please embed the link in the description
@kwizeraenock1639 Жыл бұрын
Thank you saldina for your help ❤
@ismailyousfi35212 жыл бұрын
Thenk you I learn a lot from you.
@norioimada21722 жыл бұрын
Could you show me the BFS algorithm as well?
@mr.potato88942 жыл бұрын
Is it possible to get a virtual autograph? 😂😂
@dundyd36122 жыл бұрын
Hahahha, I was wondering the same :D
@CodeBeauty2 жыл бұрын
Hahaha, something like my digital signature 😁 Maybe I'll make a few NFTs in the future and share them with my most active viewers 🤔😃
@Mzkysti2 жыл бұрын
@@CodeBeauty this video is definitely worth of a coffee at least, I'll check how that works...
@Marzex1x6 ай бұрын
Thank you!
@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!
@tofiq62 Жыл бұрын
Very good explanation! 👏
@Happys_Art Жыл бұрын
Hello. Is it okay to use this code for my homework assignment for my class. To be honest I’ve ready used it for my assignment so technically I’m just informing you that I already used this code and wanted to ask if it was okay
@nika_nothingmore Жыл бұрын
your videos are amazing!
@shinoke93952 жыл бұрын
can you setup tour also i kinda waana know and thanks for the hard work....
@Shinji912 жыл бұрын
This helps so much. Thank you!
@qaiserakram2412 жыл бұрын
I saw u an year ago U have changed alot😳
@alexanderlord15122 жыл бұрын
Thank you saldina I hope you make vedio's about problem solving
@madhusankawijerathne8435 Жыл бұрын
Really helpful. Thank you!
@alexanderlord15122 жыл бұрын
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
@sononsoft5253 Жыл бұрын
Do you have the video for BFS?
@MuhammadBilal-j9x Жыл бұрын
Hi i am trying to find how to deletion form Tree
@bishoyzakhary35312 жыл бұрын
amazing video I finally understand DFS ❤ ; can I ask you to make a video explaining BFS and red and black tree thank you
@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.
@madhusankawijerathne8435 Жыл бұрын
Thank you again
@انامسلموكفى Жыл бұрын
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
@SaiGanesh314 Жыл бұрын
Waiting for a video on BFS algorithm.... :))
@097_suryakantdhote92 жыл бұрын
Will you be doing a video on hash maps?
@handover0075 ай бұрын
You teaches so nicely , your lectures sounds like music.
@CodeBeauty5 ай бұрын
I'm happy to hear that 🥰
@uwebosse2622 жыл бұрын
perfect Explanation!
@jamalparker4487 Жыл бұрын
How does the algorithm know to go back up a node after reaching a node with no left or right linked node?
@danialsaud31892 жыл бұрын
Iwanted to ask Where to learn about functions in headers file for c++ ?
@QadimQarayev19 күн бұрын
excellent
@danielmartnutriologous2 жыл бұрын
I love you videos thank you for share you knowledge question do you have Patrion ?
@CodeBeauty2 жыл бұрын
I don't have Patreon, maybe in the future, currently I only have BuyMeACoffee 😊😃☕
@adanzavala48012 жыл бұрын
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.
@ishaankhatter63842 жыл бұрын
Hey, Can you please post more videos of data structures?
@mehdi-vl5nn2 жыл бұрын
is any difference between traversal and lookup ?
@Mamunhasan-y8e Жыл бұрын
please make graph algorithm video
@abraarz29712 жыл бұрын
Thank you!
@MaySmithereen2 жыл бұрын
Please also do the breadth first search :)
@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!
@ASHWANIKUMAR-fc5pu2 жыл бұрын
kindly add more videos
@ilham-t9y Жыл бұрын
11:56 how do the program know that the root is passed to the next node?
@spurti Жыл бұрын
BFS please!
@veslyju198411 ай бұрын
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 ?
@hbm2932 жыл бұрын
Hope everything is fine for you, following the earthquake in Stolac today!
@CodeBeauty2 жыл бұрын
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 😰