Algorithm Science (Summer 2025) - 18 - 2-3 Trees

This video was made as part of a second-year undergraduate algorithms course sequence (Algorithms and Data Structures I and II). 0:00 Dictionaries 4:12 BST Challenges 12:27 Full Trees 15:43 2-3 Trees 37:56 Higher Order Search Trees 42:10 Height of a 2-3 Tree 49:56 Operations on 2-3 Trees 54:23 Insertion into a 2-3 Tree 1:00:57 Example of a 2-3 Tree Insert Sequence 1:04:04 Removing a key from a 3-Node leaf 1:05:43 Removing a key from a 2-Node leaf 1:07:16 Cascading Removal: One Level 1:10:22 Cascading Removal: Two Levels 1:15:19 Removal from an Internal Node 1:18:01 Cascading Removal: Three Levels 1:21:41 Removal Cases 1:30:34 Overhead of Operations All slides and diagrams are original content (developed in early 2025, except for the diagrams on Slides 52 - 56 which were made in 2018). The materials used in this video, and the video itself, were prepared without any assistance from generative AI. As any viewer will quickly realize, these videos were made just like in-person lectures: in one sitting, with no breaks, editing or script. If you find any of this helpful or interesting, please let me know (I really appreciate any other feedback as well).