# 50+ Tango Tree MCQs with FREE PDF

We have the best collection of Tango Tree MCQs and answer with FREE PDF. These Tango 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.

## Tango Tree MCQs

a) Online

b) Offline

c) Static

d) Dynamic

#### 2. What is the time complexity of for achieving competitive ratio by tango tree?

a) O (log n)

b) O (n2)

c) O (n!)

d) O (log (log n))

#### 3. Who developed the concept of tango tree?

a) Erik Demaine

b) Mihai Patrascu

c) John Lacono

d) All of the mentioned

#### 4. Which type of tree is tango tree?

a) Ternary Tree

b) AVL Tree

c) Binary Search Tree

d) K-ary Tree

a) Vatican City

b) Buenos Aires

c) New York

d) California

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

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

#### 8. 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))

Answer: k+1 O (log (log n))

a) Join

b) Combinatorial

d) Concatenation

a) Differentiate

b) Cut

c) Integrate

d) Join