答案及解析：[单选题]We know the query time is O(r+log2n) using BBST for 2D range search. What is the time complexity usi

问题：

[单选题]We know the query time is O(r+log2n) using BBST for 2D range search. What is the time complexity using it for 3D range search?
我们知道了利用BBST来进行2D Range Search时，查询时间复杂度是O(r+log2n)。如果将这个数据结构推广到3D Range Search的话，时间复杂度是？
AO(r+log2n)
BO(r+logn)
CO(r+log3n)
DO(r+log4n)