Discuss B-Trees
•Notice, that if the root had needed to be spit,
–the new root will contain only one
value and have only 2 children (that is why we have the exception to the
B-Tree definition stated earlier).
•To traverse a B-Tree in sorted order,
all we need
to do is visit the search keys in sorted order by using an inorder traversal of the
B-Tree.