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

## Binary Search Tree MCQs

**1. What are the worst case and average case complexities of a binary search tree?**

a) O(n), O(n)

b) O(logn), O(logn)

c) O(logn), O(n)

d) O(n), O(logn)

**Answer: **O(n), O(logn)

**2. What does the following piece of code do?**

```
public void func(Tree root)
{
System.out.println(root.data());
func(root.left());
func(root.right());
}
```

a) Preorder traversal

b) Inorder traversal

c) Postorder traversal

d) Level order traversal

**Answer: **a

**3. What does the following piece of code do?**

```
public void func(Tree root)
{
func(root.left());
func(root.right());
System.out.println(root.data());
}
```

a) Preorder traversal

b) Inorder traversal

c) Postorder traversal

d) Level order traversal

**Answer: **Postorder traversal

**4. What is the speciality about the inorder traversal of a binary search tree?**

a) It traverses in a non increasing order

b) It traverses in an increasing order

c) It traverses in a random fashion

d) It traverses based on priority of the node

**Answer: **b

**5. Which of the following is false about a binary search tree?**

a) The left child is always lesser than its parent

b) The right child is always greater than its parent

c) The left and right sub-trees should also be binary search trees

d) In order sequence gives decreasing order of elements

**Answer: **In order sequence gives decreasing order of elements