Contents

Which type of binary search tree is imitated for construction of tango tree?
a) Complete Binary Search Tree
b) Perfect Binary Search Tree
c) Balanced Binary Search Tree
d) Degenerate Binary Search Tree

a

Which special balanced binary search tree is used to store the nodes of auxiliary tree?
a) Red – Black Tree
b) Red – Brown Tree
c) Red – Yellow Tree
d) Red – Tango Tree

a

Which of the following is also known as Rope data structure?
a) Cord                                 
b) String
c) Array                                
d) Linked List

a

Which type of data structure does rope represent?
a) Array                                
b) Linked List
c) Queue                                               
d) Binary Tree

d

What is the time complexity for finding the node at x position where n is the length of the rope?
a) O (log n)                          
b) O (n!)
c) O (n2)                                               
d) O (1)

a

What is the time complexity for creating a new node and then performing concatenation in the rope data structure?
a) O (log n)                           
b) O (n!)
c) O (n2)                                               
d) O (1)

d