Computer Science, asked by aditiparihar81, 2 months ago

construct b tree of order 3 having keys using 25, 7 ,8 , 9 ,10, 12 ,1 6 ,18 ,3​

Answers

Answered by koshalkulena
0

Answer:

B-Trees. 6. • Suppose we start with an empty B -tree and keys arrive in the following order:1 12 8 2 25 5 14 28 17 7 52 16 48 68. 3 26 29 53 ...

Similar questions