MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized in Data Structures and Algorithms
→
Is it true that splay trees have O(logn) amortized..
1.
Is it true that splay trees have O(logn) amortized complexity ?
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the disadvantage of using splay trees?
What output does the below pseudo code produces?
After the insertion operation, is the resultant tree a splay tee?
right rotation of subtree$
When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?
Which of the following options is an application of splay trees?
What is a splay operation?
Is it true that splay trees have O(logn) amortized complexity ?
Why to prefer splay trees?
Which of the following property of splay tree is correct?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply