This animation builds a B-Tree of order 5 key by key, inserting the sequence 1, 7, 6, 2, 11, 4, 8, 13, 10, 5, 17, 9, 16, 20, 3, 12, 14, 18, 19, 15. Each insertion highlights the new key, shows when a node overflows, and animates the split using the rule ceil(m/2) - 1, promoting the middle key upward. Useful for B.Tech second and third year students studying data structures and database indexing concepts.
Narrated · 9:16 · Preview before teaching · automatic layout checks do not establish subject accuracy
Create a clear educational animation showing the construction of a B-Tree of order 5 using these keys in sequence: 1, 7, 6, 2, 11, 4, 8, 13, 10, 5, 17, 9, 16, 20, 3, 12, 14, 18, 19, 15 Animate each insertion step-by-step. Whenever a node becomes full and a new key causes overflow, split the node into two parts, promote the middle key to the parent/root, and clearly animate the restructuring. Display the splitting formula: Split after ⌈m/2⌉ − 1 Use bright, readable node colours, smooth transitions, clear key labels, and highlight the newly inserted key and every split operation. Keep the style clean and suitable for a DSA educational reel in 9:16 format. Audience: B.Tech. 2nd and 3rd year students