
Already know some of this? A 2-minute test skips the lessons you know.
Take the placement testA free 15-lesson course built from Multi Atoms Plus's 2h 16m of YouTube video. 2 days at 90 minutes a day, with study notes and a quiz in every lesson. A 2-minute placement test skips what you already know.
Taught by Multi Atoms Plus on YouTube. Videos play in YouTube's own player, so the creator keeps every view.
Define a Red-Black Tree, list its five properties, and verify whether a given binary search tree satisfies all Red-Black Tree properties.
Explain the four rotation types (LL, RR, LR, RL) used in Red-Black Trees and demonstrate how each rotation restructures the tree while preserving BST properties.
State the six insertion rules for Red-Black Trees and apply them to insert the sequence 61, 58, 51, 32, 39, 29, handling red-red conflicts via recoloring and rotations.
Explain the four deletion cases in Red-Black Trees, focusing on the double-black problem and its resolution through sibling borrowing, parent recoloring, and rotations.
List B-Tree properties (order, min/max keys, min/max children) and demonstrate insertion of 10, 20, 30, 40, 50, 60, 70, 80, 90 into an order-3 B-Tree with node splitting.
Detail the three B-Tree deletion cases (leaf with sufficient keys, borrowing from sibling, merging with sibling) and apply them to delete 64, 23, and 16 from a sample order-5 tree.
Show how to delete internal nodes in a B-Tree by replacing with inorder predecessor or successor, and handle the case where both siblings have minimum keys by merging.
Define Binomial Heap as a collection of Binomial Trees, recursively define Bₖ, and prove the four key properties: 2ᵏ nodes, height k, exact node count per depth, and root degree.
Perform Binomial Heap insertion for the sequence 7, 2, 4, 17, 1, 11, 6, 8, 15, 10, 20, merging trees whenever binomial heap properties (unique Bₖ, increasing order) are violated.
Explain Skip List as a probabilistic multi-level linked list, demonstrate search by skipping nodes, and derive the expected number of nodes at level i using n * pⁱⁱ * pⁱ formula (PYQ 2025-26).