B-Tree degree 5

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. Can someone tell me what B-tree Degree 5 actually means. 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)
hi jsmith,

I have been looking through the article on wikipedia but it does not mention anything about a "degree 5", is this the same as a B-tree of order 5?
I would assume so.
Hi Jsmith, thank you for getting back to me once again, I was wondering why I had not seen a degree of 5 on any documentation and I think it is a case of bad terminology use in the question. Can you please look at my answer and see if i am adding and deleting from the tree appropriately.

1. 10

2. 10,100

3. 10,30,100

4. 10,30,80,100

5. 10,30,50,80,100

6. 30,50,80,100

7. 30,50,60,80,100

8. 30,50---60---70,80,100

9. 30,40,50---60---70,80,100


10. 30,40,50---60---70,100

11. 30,40,50---60---70,90,100

12. 20,30,40,50---60---70,90,100

13. 20,40,50---60---70,90,100

14. 20,30,40,50---60---90,100
Topic archived. No new replies allowed.