Skip to content

Quiz on Binary Search Tree in DSA

Quiz on Binary Search Tree in DSA

Time limit: 0

Quiz Summary

0 of 10 Questions completed

Questions:

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 10 Questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Not categorized 0%

Review / Skip
Answered
Correct
Incorrect

Question 1 of 10

1. Question

What is a Binary Search Tree (BST)?

A tree where each node has at most three children
Correct Incorrect Correct answer

A tree with only leaf nodes
Correct Incorrect Correct answer

A tree where the left child is smaller and the right child is larger than the parent
Correct Incorrect Correct answer

A tree that only stores even numbers
Correct Incorrect Correct answer

Correct

Incorrect
Question 2 of 10

2. Question

Which of the following elements would be in the right subtree of a node with value 10 in a BST?

5
Correct Incorrect Correct answer

3
Correct Incorrect Correct answer

10
Correct Incorrect Correct answer

12
Correct Incorrect Correct answer

Correct

Incorrect
Question 3 of 10

3. Question

What is the time complexity of searching an element in a balanced BST?

O(1)
Correct Incorrect Correct answer

O(n)
Correct Incorrect Correct answer

O(log n)
Correct Incorrect Correct answer

O(n²)
Correct Incorrect Correct answer

Correct

Incorrect
Question 4 of 10

4. Question

In a BST, where is the minimum element located?

At the root
Correct Incorrect Correct answer

Rightmost node
Correct Incorrect Correct answer

Leftmost node
Correct Incorrect Correct answer

Middle node
Correct Incorrect Correct answer

Correct

Incorrect
Question 5 of 10

5. Question

What happens when you insert a duplicate value in a standard BST?

It replaces the existing node
Correct Incorrect Correct answer

It gets ignored or rejected
Correct Incorrect Correct answer

It is inserted at a random position
Correct Incorrect Correct answer

It causes the tree to crash
Correct Incorrect Correct answer

Correct

Incorrect
Question 6 of 10

6. Question

Which traversal method gives sorted order in a Binary Search Tree?

Preorder
Correct Incorrect Correct answer

Inorder
Correct Incorrect Correct answer

Postorder
Correct Incorrect Correct answer

Level order
Correct Incorrect Correct answer

Correct

Incorrect
Question 7 of 10

7. Question

What is the worst-case time complexity for searching in an unbalanced BST?

O(log n)
Correct Incorrect Correct answer

O(n)
Correct Incorrect Correct answer

O(1)
Correct Incorrect Correct answer

O(n log n)
Correct Incorrect Correct answer

Correct

Incorrect
Question 8 of 10

8. Question

In which case can a BST become skewed like a linked list?

When all inserted elements are random
Correct Incorrect Correct answer

When elements are inserted in sorted order
Correct Incorrect Correct answer

When deletion is not performed
Correct Incorrect Correct answer

When balancing is applied
Correct Incorrect Correct answer

Correct

Incorrect
Question 9 of 10

9. Question

Which of these is NOT a valid operation on a BST?

Insertion
Correct Incorrect Correct answer

Deletion
Correct Incorrect Correct answer

Sorting
Correct Incorrect Correct answer

Searching
Correct Incorrect Correct answer

Correct

Incorrect
Question 10 of 10

10. Question

What does deleting a node with two children in a BST require?

Deleting the root node directly
Correct Incorrect Correct answer

Replacing it with the leftmost node of the left subtree
Correct Incorrect Correct answer

Replacing it with the rightmost node of the right subtree
Correct Incorrect Correct answer

Replacing it with the inorder successor or predecessor
Correct Incorrect Correct answer

Correct

Incorrect

Fill the form to proceed
Upskill & get ready for AI-era

Please leave this field empty.

Δ

Our executives will contact you shortly

Have Questions?
Talk directly to the Instructor

Please leave this field empty.

Δ

Our executives will arrange a call with the Instructor shortly

talk to the instructor

Career Counselling

Please leave this field empty.

Δ

Login

Accessing this course requires a login. Please enter your credentials below!

Username or Email Address

Password

Remember Me

Signup / Login with Google

Signup / Login with X

Lost Your Password?

Register

Don't have an account? Register one!

Register an Account