B-tree degree 5?

Can someone tell me what a B-tree of degree 5 means
I have to answer the following question as part of an assignment and I am not sure what the question even means so any help on this matter would be greatly appreciated. I am not asking anyone to do my homework for me I am simply asking for some direction on what I have to do. Thank you in advance

QUESTION:

Execute the following sequence of operations on an initially empty ADT table t that is implemented as a B-tree of degree 5. Note that insertion into an empty B-tree will create a single node that contains the inserted item.

t.tableInsert (10)
t.tableInsert (100)
t.tableInsert (30)
t.tableInsert (80)
t.tableInsert (50)
t.tableDelete (10)
t.tableInsert (60)
t.tableInsert (70)
t.tableInsert (40)
t.tableDelete (80)
t.tableInsert (90)
t.tableInsert (20)
t.tableDelete (30)
t.tableDelete (70)
http://en.wikipedia.org/wiki/B-tree

I assume degree of 5 is same thing as 5th order.
Does this mean that the root node can initially hold up to 5 pieces of data with each node also being able to contain 5 pieces of data?
Topic archived. No new replies allowed.