# 50+ Randomized Binary Search Tree MCQs with FREE PDF

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

## Randomized Binary Search Tree MCQs

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

a) n + 1

b) (n + 1)/3

c) (n + 1)/2

d) n + 3

#### 3. Which of the following is not a random tree?

a) Treap

b) Random Binary Tree

c) Uniform Spanning Tree

d) AVL Tree

#### 4. Which process forms the randomized binary search tree?

a) Stochastic Process

b) Branching Process

c) Diffusion Process

d) Aggregation Process

a) 2

b) 3

c) 6

d) 5

a) True

b) False

#### 7. What is the probability of selecting a tree uniformly at random?

a) Equal to Catalan Number

b) Less Than Catalan Number

c) Greater than Catalan Number

d) Reciprocal of Catalan Number

a) True

b) False

a) log x

b) x2

c) x!

d) 4.311 log x

a) (-1, 0)

b) (1, 0)

c) (0, 5)

d) (0, 1)