Thread: M-Way Search Tree

  1. #1
    Registered User
    Join Date
    Nov 2005
    Posts
    12

    M-Way Search Tree

    If I'm given a M-Way Search Tree, how would I determine it is a B-Tree with the parameter K < M, where K is the value that is to be inserted and M is the Order of the M-Way Search Tree. This is not something that I really need to code, but something to understand and then give a general summary on how to check for it, even general pseudo code would work. I know that an M-Way Search tree is also a B-Tree but not vice versa, so I just curious how they would tie in together with the specification of k < m before determining if the M-Way Tree is a B-Tree. Thank you for your time and help in advance.

  2. #2
    and the hat of int overfl Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    39,660
    OK, last chance - http://www.nist.gov/dads/

  3. #3
    Registered User
    Join Date
    Nov 2005
    Posts
    12
    hm . . . quite unhelpful. If you can not contribute to answering the post, then its best for you to keep quiet.

    I already know what an M-Way Search Tree is and the properties it holds such as the higest level it may acquire and the max number of children a node may have. I'm more interested on how I can check to see if it is also a B-Tree with the condition of checking the key < order (m).

  4. #4
    and the hat of int overfl Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    39,660
    Ok, deal.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Binary Search Trees Part III
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 16
    Last Post: 10-02-2004, 03:00 PM
  2. Tutorial review
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 11
    Last Post: 03-22-2004, 09:40 PM
  3. Request for comments
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 15
    Last Post: 01-02-2004, 10:33 AM
  4. BST/Red and Black Tree
    By ghettoman in forum C++ Programming
    Replies: 0
    Last Post: 10-24-2001, 10:45 PM