## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

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

## Click on any option to know the CORRECT ANSWERS

Question 6 |

Which type of binary search tree is imitated for construction of tango tree?

Complete Binary Search Tree | |

Perfect Binary Search Tree | |

Balanced Binary Search Tree | |

Degenerate Binary Search Tree |

**Data interpretation (DI) Questions answers**

Question 6 Explanation:

Tango tree is constructed by simulating a complete binary search tree. This tree is also known as Reference tree, that contains all the elements of the tree. Also, the reference tree is never showed in actual implementation.

Question 7 |

Which special balanced binary search tree is used to store the nodes of auxiliary tree?

Red - Black Tree | |

Red - Brown Tree | |

Red - Yellow Tree | |

Red - Tango Tree |

**Data interpretation (DI) Questions answers**

Question 7 Explanation:

The path starting from the root and following the path of preferred child node till the end of leaf node is known as preferred path. Nodes are stored in Red - Black tree for the representation of the preferred path.

Question 8 |

Is tango tree represented as a tree of trees.

True | |

False |

**UPSC Questions answers**

Question 8 Explanation:

Partitioning method is used by tango tree which partitions a binary search tree into small sets of paths and then storing them to auxiliary trees. Hence tango tree is represented as a tree of trees.

Question 9 |

Which operation is used to combine two auxiliary trees?

Join | |

Combinatorial | |

Add | |

Concatenation |

**Home science Questions answers**

Question 9 Explanation:

If the top node of one of the reference tree amongst the two, is the is the child of the bottom node of the other reference tree, then the join operation can be carried out to join the two auxiliary trees.

Question 10 |

Is partitioning method used by Tango Tree.

True | |

False |

**Sociology Questions answers**

Question 10 Explanation:

Partitioning method is used by tango tree which partitions a binary search tree into small sets of paths and then storing them to auxiliary trees. Hence tango tree is represented as a tree of trees.

There are 10 questions to complete.