5.4 Implementation of 2-3 tree【含答案】 数据结构(Data Structures)

(1)判断题

2-3 tree is always balanced?

(2)判断题

The time cost to search one element in a 2-3 tree is Θ(log n) in average case, and Θ(1) in best case. 

(3)填空题

 a 2-3 tree whose height is 3 can store _______ [填空1]keys at most.

获取标准答案请阅读全文

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