# Randomized Binary Search Tree Multiple choice Questions and Answers (MCQs)

## Randomized Binary Search Tree Multiple choice Questions and Answers (MCQs)

 Question 1
Which of the following is a random tree?
 A Treap B Random Binary Tree C Uniform Spanning Tree D All of the mentioned
Question 1 Explanation:
Treap, also known as random binary search tree, Random binary tree and Uniform spanning tree are all random tree. Random tree is a tree formed by a random process of addition and deletion of nodes.

 Question 2
Which process forms the randomized binary search tree?
 A Stochastic Process B Branching Process C Diffusion Process D Aggregation Process
Question 2 Explanation:
The randomized binary search tree is formed by the stochastic process. The stochastic process or also called random process is a mathematical tool or object including random variables.

 Question 3
How many randomized binary search trees can be formed by the numbers (1, 3, 2)?
 A 2 B 3 C 6 D 5
Question 3 Explanation:
As there are 3 numbers (1, 3, 2) so total of 6 combinations can be formed using three numbers but Since (2, 1, 3) and (2, 3, 1) are same so in total there are 5 randomized binary search tree that can be formed.

 Question 4
What is the expected depth of a node in a randomized binary search tree?
 A log n B n! C n2 D 2 log n + O(1)