Preorder/Postorder Traversal of Multiway Search Tree (B-Tree)

Hi All,

Suppose I have a set of keys which I populate in a Binary Search Tree
as well as a Multiway Search Tree (B-Tree). Lets call the binary
search tree as T1 and B-Tree as T2.

1. Will a preorder traversal of T1 visit the keys in the same
sequence as a preorder traversal of T2?

2. Will a postorder traversal of T1 visit the keys in the same
sequence as a postorder traversal of T2?

Any help on this much appreciated.

Thank you.

Rgds,
anna
.

Relevant Pages

  • Re: Binary Search Tree
    ... > search tree due to running time concerns. ... > container classes such as set use a balanced BST internally. ... binary search tree time complexity). ...
    (comp.lang.cpp)
  • 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: tree errors
    ... I will post it anyway the code compiles but I get a segmentation fault. ... I think a linked list or binary search tree is what ... search tree, or "some kind of database algorithm", you're not ...
    (comp.lang.c)
  • 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)