Lecture 30 - Multiway Search Trees [Advanced Data Structures]

In this lecture, we are introduced to Multiway Search Trees. Multiway Search Trees are a generalization of Binary Search Trees. We will explore and use ideas we have had from previously in the course to construct the far more general structure. This includes pulling out ideas like binary search, for finding and inserting data in the tree.

Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
-Draikou
Patreon Supporters (Basic Support):
-Eric R
-Tor Asbjørn Bekkelund
Patreon Supporters (Special Thank You, and Supporter Access!):
-TracyMae
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:

Want the notes, and/or want to support my mission? Look no further, get the written companion to this video lectures series. Buy the book, Advanced Data Structures: An Introduction to Data Structures and Algorithms, it is available at the below links (by format, given in parentheses):

Follow also at:

Time Stamps:
0:00 Generalizations of Binary Search Trees, Multiway Search Trees
2:23 Definition of Multiway Search Tree
8:45 Example of Multiway Search Tree
11:32 Definition of order/degree of Multiway Search Tree
14:22 Is this a Multiway Search Tree?
17:30 Inorder Traversal of Multiway Search Tree
19:19 get (searching) in a Multiway Search Tree, encoding of a node
41:07 smallest in a Multiway Search Tree
47:00 put (insertion) in a Multiway Search Tree
52:52 Remark about insertions and the structure of tree, with no restriction

Have a beautiful day!

#Trees
#ComputerScience
#DataStructures