B-tree question.

R. Clayton (rclayton@monmouth.edu)
Tue, 15 Feb 2000 10:22:35 -0500 (EST)

• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
• Next message: R. Clayton: "Homework 3, question 1 question."
• Previous message: R. Clayton: "Red-black tree animations."

  I believe in non-empty B-tree root can have minimum two nodes which means
  root has one key

Almost. If the root is an internal node, then two children means one key. If
the root is a leaf, then it has no children and anywhere from zero to 2t - 1
keys.

  and maximum it can have 2t nodes means root can have maximum 2t-1 keys.
  Is this correct?

Yes, with the same qualification about leaves and internal nodes.

• Next message: R. Clayton: "Homework 3, question 1 question."
• Previous message: R. Clayton: "Red-black tree animations."

This archive was generated by hypermail 2.0b3 on Wed Apr 26 2000 - 09:35:05 EDT