Red-Black Tree Insertion Explained
Red-Black Trees are a self balancing binary search tree, and in this video I am giving you an example of how to insert in a Red-Black Tree and an extra tip of how to perform this insertion efficiently.
This video is useful to anyone that is taking an Algorithms and Data Structures class, which requires the old school pen and paper insertion of trees. So whether you have just started out learning about algorithms or coding, this is a great starting point as it offers you the insights of how the Red-Black Tree algorithm works.
Link to Binary Search Tree tutorial:
• Binary Search Trees (BST) - Insertion Expl...
Link to 2-3 Tree Tutorial:
• 2-3 Tree Insertion Explained
Let´s connect:
Instagram: @biancadata
Twitch: bianca_jordan