tags:

views:

16

answers:

0
Q: 

B-tree: How many keys are left in root node??

add the following keys to a B-tree, the provided order is :

       18, 44, 63, 5, 3, 7, 46, 38, 22, 37.

The oder of B-tree is 4.

Q: How many keys are left in root node?

I thought it was 1, because the order = 4... but it is wrong!!

related questions

Maximum number of descendants in a B-tree
Are keys in B-tree nodes duplicated when the node is split?
Do btrees and b+trees only store data at the leafs?
What is a B-tree page
Do DB indexes take same amount of disc space as column data?
how B-tree indexing works in mysql
Best data structure for crossword puzzle search
Does anybody know how B-Tree got its name?
How are B Tree nodes typically represented?
C/C++: How to store data in a file in B tree
Advantages of BTree+ over BTree
Using code from a book without plagiarizing
size of B+ tree
Does anyone know where I might find a file based multi-way B-Tree Class for c#?
Looking for a disk-based B+ tree implementation in C++ or C
good ADT to implement BTREE
javascript binary search tree implementation
Which datastructure is appropriate for this situation?
Is there an API to draw a B-TREE?
saving Btrees to a disk file and read it
What's the difference between B-Tree and GiST index methods (in PostgreSQL)?
Larger than memory data structures and how they are typically handled
Techniques for Caching SQL Query Data
Binary Search or Btree index Update problem
What is a good open source B-tree implementation in C?