Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Data Structures
/
Exercises
/
Exercise 5
Data Structures
medium
0/15 answered
Q1
In a splay tree, what is the amortized time complexity of search?
A
O(1)
B
O(log n)
C
O(n)
D
O(n log n)
← Prev
1 / 15
Next →
← Exercise 4
Exercise 5 of 7
Exercise 6 →