**DOWNLOAD FREE PDF** **<<CLICK HERE>>**

## Treap Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed *Treap Multiple choice Questions and Answers (MCQs)*.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

What is the space complexity of a treap algorithm?

O(N) | |

O(log N) | |

O(log N) | |

O(N ^{2}) |

# CLICK HERE FOR ALL SUBJECTS MCQ

Question 1 Explanation:

The average case and worst case space complexity of a treap is mathematically found to be O(N).

Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

A treap is a combination of a tree and a heap.

false | |

true |

# CLICK HERE FOR ALL SUBJECTS MCQ

Question 2 Explanation:

A treap is a combination of a tree and a heap. The structure of a treap is determined by the fact that it is heap-ordered.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

Which is the simplest of all binary search trees?

AVL tree | |

Treap | |

Splay tree | |

Binary heap |

# CLICK HERE FOR ALL SUBJECTS MCQ

Question 3 Explanation:

A treap is the simplest of all binary search trees. Each node is given a numeric priority and implementation is non recursive.

Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

What is the reason behind the simplicity of a treap?

Each node has data and a pointer | |

Each node is colored accordingly | |

It is a binary search tree following heap principles | |

Each node has a fixed priority field |

# CLICK HERE FOR ALL SUBJECTS MCQ

Question 4 Explanation:

A treap is the simplest of all because we don't have to worry about adjusting the priority of a node.

Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

What is the condition for priority of a node in a treap?

a node's priority should be greater than its parent | |

a node's priority should be at least as large as its parent | |

the priority is randomly assigned and can have any value | |

a node's priority is always given in decreasing order |

# CLICK HERE FOR ALL SUBJECTS MCQ

Question 5 Explanation:

A node's priority should satisfy heap order. That is, any node's priority should be at least as large as its parent.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.

There are 5 questions to complete.