1.

In what time can a 2-d tree be constructed?

A. O(N)
B. O(N log N)
C. O(N2)
D. O(M log N)
Answer» C. O(N2)


Discussion

No Comment Found