This page provides a summary of my favorite topic in CS400, B-Trees!

Here is a list of important considerations when using this data structure:

• All leaves are at the same level/depth, as they are self-balancing.
• They are defined by a minimun degree 't'. Every node except the root must contain at least t-1 keys. The root may contain a minimum of 1 key.
• Ensure that insertions and deletions maintain the B-tree’s balance by handling node splitting and merging carefully.

Here is an example of a 2-3-4 B-Tree and a link to the webpage with more information about it:

B-Tree Link!