2-3 Tree Insertion Explained
In this video I am giving you a brief introduction to 2-3 trees, followed by an example of insertion into an empty 2-3 tree. Two-Three trees are extremely useful for data storage, and are one of the most used Data Structures, by Data Scientists because of their property of trying to solve unbalanced trees.
This video prepares you for an Algorithms and Data Structures written exam, where Insertion into an empty 2-3 tree is required. So if you have a bit of experience with coding, or even if you are just starting out learning about Algorithms and Data Structures this video is a great starting point of grasping this knowledge.
Here is the link to Binary Search Tree Insertion:
• Binary Search Trees (BST) - Insertion Expl...
Let´s connect:
Instagram: @biancadata
Twitch: bianca_jordan