A.B-樹(shù)和B+樹(shù)都是平衡的多叉樹(shù) B.B-樹(shù)和B+樹(shù)都可用于文件的索引結(jié)構(gòu) C.B-樹(shù)和B+樹(shù)都能有效地支持順序檢索 D.B-樹(shù)和B+樹(shù)都能有效地支持隨機(jī)檢索
A.根結(jié)點(diǎn)至多有m棵子樹(shù) B.所有葉子都在同一層次上 C.非葉結(jié)點(diǎn)至少有m/2 (m為偶數(shù))或m/2+1(m為奇數(shù))棵子樹(shù) D.根結(jié)點(diǎn)中的數(shù)據(jù)是有序的
A.LL B.LR C.RL D.RR