Data Structure Questions and Answers-Splay Tree

DOWNLOAD FREE PDF <<CLICK HERE>>

Data Structure Questions and Answers-Splay Tree

Congratulations - you have completed Data Structure Questions and Answers-Splay Tree.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%


Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What are splay trees?
A
self adjusting binary search trees
B
self adjusting binary trees
C
a tree with strings
D
a tree with probability distributions
Question 1 Explanation: 
Splay trees are height balanced, self adjusting BST's.

Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which of the following property of splay tree is correct?
A
it holds probability usage of the respective sub trees
B
any sequence of j operations starting from an empty tree with h nodes atmost, takes O(jlogh) time complexity
C
sequence of operations with h nodes can take O(logh) time complexity
D
splay trees are unstable trees
Question 2 Explanation: 
This is a property of splay tree that ensures faster access. we push the most recently used nodes to top which leads to faster access to recently used values.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Why to prefer splay trees?
A
easier to program
B
space efficiency
C
easier to program and faster access to recently accessed items
D
quick searching
Question 3 Explanation: 
Whenever you insert an element or remove or read an element that will be pushed or stored at the top which facilitates easier access or recently used stuff.

Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Is it true that splay trees have O(logn) amortized complexity?
A
true
B
false
Question 4 Explanation: 
We go with amortized time complexity when we feel that not all operations are worst and some can be efficiently done. in splay trees not all splay operations will lead to O(logn) worst case complexity.

Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What is a splay operation?
A
moving parent node to down of child
B
moving a node to root
C
moving root to leaf
D
removing leaf node
Question 5 Explanation: 
Splay trees mainly work using splay operations. wheneve we insert, delete and search for a node we splay the respective nodes to root. we have zig-zag and zig-zig operations.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results
There are 5 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>