题目
题目

XLMC0202501 Topic 18 Quiz

单项选择题

In the worst case, what is the time complexity of performing a range search of a k-d tree in terms of the number of nodes n in the tree?  

选项
A.O(1)
B.O(n)
C.O(log n)
D.O(n^2)
查看解析

查看解析

标准答案
Please login to view
思路分析
To begin, let's lay out the scenario: we are performing a range search on a k-d tree with n nodes, and we want the worst-case time complexity. Option 1: O(1). This would imply the search finishes in constant time regardless of n, which is not possible for a search over a data structure containing n n......Login to view full explanation

登录即可查看完整答案

我们收录了全球超50000道考试原题与详细解析,现在登录,立即获得答案。

更多留学生实用工具

加入我们,立即解锁 海量真题独家解析,让复习快人一步!