# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Tango Tree Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Who developed the concept of tango tree?

Erik Demaine | |

Mihai Patrascu | |

John Lacono | |

All of the mentioned |

Question 1 Explanation:

Erik Demaine is a well-known professor of Computer Science at MIT. John Lacono is an American computer scientist specialized in data structure and algorithm while Mihai Patrascu was a Romanian- American computer scientist. All of them together developed the concept of Tango tree.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which type of tree is tango tree?

Ternary Tree | |

AVL Tree | |

Binary Search Tree | |

K-ary Tree |

Question 2 Explanation:

Tango tree is an example of binary search tree which was developed by four famous scientists Erik Demaine, Mihai Patrascu, John Lacono and Harmon in the year 2004.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

After which city is tango tree named?

Vatican City | |

Buenos Aires | |

New York | |

California |

Question 3 Explanation:

Tango is a popular couple dance or partner dance that was originated in the 1880s somewhere between Argentina and Uruguay. Buenos Aires is a capital city off Argentina. Hence they named after Buenos Aires.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which type of binary search tree or algorithm does tango tree use?

Online | |

Offline | |

Static | |

Dynamic |

Question 4 Explanation:

Tango tree is an online binary search tree whose time complexity is O (log (log n)) when compared to the time complexity of offline binary search tree model. Online algorithm processes input or data provided piece by piece.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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

O (log n) | |

O (n ^{2}) | |

O (n!) | |

O (log (log n)) |

Question 5 Explanation:

Tango tree is an online binary search tree whose time complexity is O (log (log n)) when compared to the time complexity of offline binary search tree model. Online algorithm processes input or data provided piece by piece.

There are 5 questions to complete.