One view of an in-order traversal would be that its output is an ordered list. To find
or place an element in it, you would interrupt the scan when the proper location is
found. With a b-tree however, searches and inserts become a series of left-or-right
decisions where each decision eliminates the need for many compares. So these
ideas of looking at everything in order (traversal), versus finding the right slot
(b-tree search), don't have a lot in common.