5.3 2-3 tree index【含答案】 数据结构(Data Structures)

(1)单选题

After insert the elements (8,10,30,5,15,2,20) into an empty 2-3 tree one by one, the depth of the node containing 10 is_________

A  0

B  1

C  2

D  3

获取标准答案请阅读全文

未经允许不得转载!5.3 2-3 tree index【含答案】 数据结构(Data Structures)