# Tango Tree Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 11
Which operation is used to break a preferred path into two sets of parts at a particular node?
 A Differentiate B Cut C Integrate D Join

Question 11 Explanation:
A preferred path is broken into two parts. One of them is known as top part while other is known as bottom part. To break a preferred path into two sets, cut operation is used at a particular node.

 Question 12
What is the upper bound for a tango tree if k is a number of interleaves?
 A k+2 O (log (log n)) B k O (log n) C K2 O (log n) D k+1 O (log (log n))

Question 12 Explanation:
Upper bound is found to analyze the work done by a tango tree on a given set of sequences. In order to connect to the tango tree, the upper bound is found to be k+1 O (log (log n)).

 Question 13
What is the time complexity for searching k+1 auxiliary trees?
 A k+2 O (log (log n)) B k+1 O (log n) C K+2 O (log n) D k+1 O (log (log n))

Question 13 Explanation:
Since each search operation in the auxiliary tree takes O (log (log n)) time as auxiliary tree size is bounded by the height of the reference tree that is log n. So for k+1 auxiliary trees, total search time is k+1 O (log (log n)).

 Question 14
What is the time complexity for the update cost on auxiliary trees?
 A O (log (log n)) B k-1 O (log n) C K2 O (log n) D k+1 O (log (log n))

Question 14 Explanation:
The update cost also is bounded by the upper bound. We perform one cut as well as one join operation for the auxiliary tree, so the total update cost for the auxiliary tree is found to be k+1 O (log (log n)).

 Question 15
Which of the following is the self-adjusting binary search tree?
 A AVL Tree B Splay Tree C Top Tree D Ternary Tree