Inorder Traversal of B-Tree

Hi All,

Can anybody tell me whether an in-order traversal of a B-Tree will
result in the keys being listed in ascending order? I am trying to
find out the correct way to do an inorder traversal of a B-Tree. Any
help much appreciated.

Any URLs with relevant information would be very useful.

Thank you.

Rgds,
anna
.

Relevant Pages

  • Re: Inorder Traversal of B-Tree
    ... result in the keys being listed in ascending order? ... find out the correct way to do an inorder traversal of a B-Tree. ... I am looking for multiway tree traversal, ... While traversing a B-Tree, ...
    (comp.programming)
  • Re: Data structure for indexing on multiple keys.
    ... > I have fair knowledge of B-tree and hash indexing mechanisms. ... > What data structure/algorithms should I read upon if I want to ... > Please note that this is not about composite keys but supporting ... database for other operations? ...
    (comp.programming)
  • Re: Data structure for indexing on multiple keys.
    ... > I have fair knowledge of B-tree and hash indexing mechanisms. ... > What data structure/algorithms should I read upon if I want to ... > Please note that this is not about composite keys but supporting ... database for other operations? ...
    (comp.theory)
  • Re: Inorder Traversal of B-Tree
    ... be built upon the properties of a B-tree that allow it to keep the ... traversal of a B-Tree is correct by looking at the order in which the ... keys are being visited. ...
    (comp.programming)