50+ Splay Tree MCQs with FREE PDF

We have the best collection of Splay Tree MCQs and answer with FREE PDF. These Splay Tree MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Splay Tree MCQs

1. 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

Answer: b

2. Which of the following options is an application of splay trees?

a) cache Implementation

b) networks

c) send values

d) receive values

Answer: a

3. 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

Answer: a

4. 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

Answer: b

5. 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

Answer: c

6. 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?

a) no there is no special usage

b) In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available

c) redblack and avl are not upto mark

d) they are just another type of self balancing binary search trees

Answer: b

7. Is it true that splay trees have O(logn) amortized complexity?

a) true

b) false

Answer: a

8. What is the disadvantage of using splay trees?

a) height of a splay tree can be linear when accessing elements in non decreasing order.

b) splay operations are difficult

c) no significant disadvantage

d) splay tree performs unnecessary splay when a node is only being read

Answer: a

9. What output does the below pseudo code produces?

Tree_node function(Tree_node x)
    {
        Tree_node y = x.left;
        x.left = y.right;
        y.right = x;
        return y;
    }

a) right rotation of subtree

b) left rotation of subtree

c) zig-zag operation

d) zig-zig operation

Answer: a

Splay Tree MCQs PDF Download

50+ Binary Trees using Array MCQs with FREE PDF
50+ Binary Trees using Linked Lists MCQs with FREE PDF
50+ Binary Tree Operations MCQs with FREE PDF
50+ Preorder Traversal MCQs with FREE PDF
50+ Postorder Traversal MCQs with FREE PDF
50+ Inorder Traversal MCQs with FREE PDF
50+ Binary Tree Properties MCQs with FREE PDF
50+ Binary Search Tree MCQs with FREE PDF
50+ Balanced Binary Tree MCQs with FREE PDF
50+ Self Balancing Binary Search Tree MCQs with FREE PDF
50+ Randomized Binary Search Tree MCQs with FREE PDF
50+ AA Tree MCQs with FREE PDF
50+ AVL Tree MCQs with FREE PDF
50+ Cartesian Tree MCQs with FREE PDF
50+ Weight Balanced Tree MCQs with FREE PDF
50+ Red Black Tree MCQs with FREE PDF
50+ Top Tree MCQs with FREE PDF
50+ Treap MCQs with FREE PDF
50+ Threaded Binary Tree MCQs with FREE PDF
50+ Tango Tree MCQs with FREE PDF
50+ Rope MCQs with FREE PDF

Comments