Binary Trees: Theory and C++ Implementation [Part 2] | Data Structures & Algorithms # 4

☕️ Buy me a coffee: https://paypal.me/donationlink240 🙏🏻 Support me on Patreon: https://www.patreon.com/c/ahmadbazzi In this Part 2 lecture, we take a deep look into the theory and C++ implementation of a Binary Tree. You can find part 1 here: https://youtu.be/zuuAPYiMYDA The contents of this lecture are outlined as follows: *********************** OUTLINE *********************** 00:00:00 C++: DELETE from a Binary Tree 00:13:14 Theory: Tree Traversals 00:19:28 Theory: Recursive calls & memory behaviour 00:25:49 C++: Recursive Breadth First Traversal 00:31:58 C++: Max in a Binary Tree 00:34:36 Theory: Binary Tree via Arrays 00:38:28 C++: Binary Tree via Arrays 00:46:19 Wrap up 🔴 Subscribe for more videos on data structures and algorithms. 👍 Smash that like button, in case you find this tutorial useful. 👁‍🗨 Speak up and comment, I am all ears. *********************** INSTRUCTOR *********************** Instructor: Dr. Ahmad Bazzi IG: https://www.instagram.com/drahmadbazzi/ FB: https://www.facebook.com/profile.php?id=100002083151128 RG: https://www.researchgate.net/profile/Ahmad_Bazzi MSE: https://math.stackexchange.com/users/310385/ahmad-bazzi?tab=profile YT: https://www.youtube.com/c/AhmadBazzi *********************** CREDITS🙏🏻 *********************** Microsoft OneNote: https://products.office.com/en-gb/onenote VSCode: https://code.visualstudio.com/ #C++ #datastructure #binarytree