Suggest an algorithm to traverse a B+ tree

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

I think its a good approach to use a depth-first traversal in preorder and to mark the visited nodes, to avoid traverse a visited node again.