[問題] B-tree畫法
1.插入a,g,f,b,k,d,h,m,i,e,s,i,r,x的鍵在空的度數五的B-tree裡,結果要怎麼畫?
2.What is the smallest number of entries that,when inserted in
an appropriate order,will force a B-tree of order 5 to have heigh 3
(that is,4levels)?
拜託各位大大了 >_<
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.175.55.84
推
06/24 11:39, , 1F
06/24 11:39, 1F