Binary Search Tree and Balanced Binary Tree Quiz Online Practice Test

1. Which statement about a binary search tree is incorrect?

The left child is always smaller than its parent

The right child is always larger than its parent

Both left and right subtrees must also be binary search trees

The in-order traversal yields elements in decreasing order

2. What is unique about the in-order traversal of a binary search tree?

It traverses in non-increasing order

It traverses in increasing order

It traverses in a random order

It traverses based on node priority

3. What are the worst-case and average-case time complexities of a binary search tree?

O(n), O(n)

O(log n), O(log n)

O(log n), O(n)

O(n), O(log n)

4. What defines an optimal binary search tree, and what is its benefit?

The tree must remain static and you need to know key access frequencies; this reduces lookup cost

Knowing key access frequencies improves lookup time

The tree can be adjusted and knowing the number of elements beforehand enhances deletion time

Modifying the tree enhances lookup time

5. What is the height of a balanced full binary tree with 8 leaves?

6. How is the balance factor of a node in a binary tree calculated?

Sum of the heights of the left and right subtrees

Height of the right subtree minus the height of the left subtree

Height of the left subtree minus the height of the right subtree

Height of the right subtree minus one

7. A binary tree is considered balanced if the height difference between the left and right subtrees of every node is no more than:

8. Which of the following tree data structures does not guarantee balance in the binary tree?

AVL tree

Red-black tree

Splay tree

B-tree

9. In a balanced binary tree with ( n ) items, the worst-case time for looking up an item is:

O(log n)

O(n log 2)

O(n)

O(1)

10. Which of the following data structures can be efficiently implemented using a height-balanced binary search tree?

Sets

Priority queues

Heaps

Both sets and priority queues

11. In a balanced binary tree with \( n \) items, the worst-case time for looking up an item is:

O(log n)

O(n log 2)

O(n)

O(1)

12. Which of the following is an advantage of a balanced binary search tree, like an AVL tree, over a binary heap?

Insertion takes less time

Deletion takes less time

Searching takes less time

Construction of the tree takes less time than a binary heap

13. AVL trees are more balanced than Red-Black trees.

True

False

Not always true

Depends on the implementation

Test Name:	Binary Search Tree and Balanced Binary Tree Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	13 / 13
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Binary Search Tree and Balanced Binary Tree MCQ Quiz Online Practice Test