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
Which of the following options is an application of splay trees?
a) cache Implementation
b) networks
c) send values
d) receive values
Explanation: Splay trees can be used for faster access to recently accessed items and hence used for cache implementations.
What is the space complexity of a treap algorithm?
a) O(N)
b) O(log N)
c) O(N log N)
d) O(N2)
Explanation: The average case and worst case space complexity of a treap is mathematically found to be O(N).
Which is the simplest of all binary search trees?
a) AVL tree
b) Treap
c) Splay tree
d) Binary heap
Explanation: A treap is the simplest of all binary search trees. Each node is given a numeric priority and implementation is non-recursive.
What is the reason behind the simplicity of a treap?
a) Each node has data and a pointer
b) Each node is colored accordingly
c) It is a binary search tree following heap principles
d) Each node has a fixed priority field
What is a threaded binary tree traversal?
a) a binary tree traversal using stacks
b) a binary tree traversal using queues
c) a binary tree traversal using stacks and queues
d) a binary tree traversal without using stacks and queues
