建议遍历B +树的算法

Question

Please suggest me an algorithm that will traverse a B+ tree of order 4 and display on the screen all its integer key entries in order of keys (smaller keys first). I have to write this in C++, but even pseudo code would be appreciated. Or even a small guide to write the algorithm will help. Thanks.

Answer 1

我认为这是一种很好的方法，可以预先使用深度优先遍历并标记访问的节点，以避免再次遍历访问的节点 。