Data Structure › Tree › Question #5628
Single Choice Easy

QWhat is the time complexity of searching a node in a binary search tree?

ID: #5628 Tree 140 views
Question Info
#5628Q ID
EasyDifficulty
TreeTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(log n) ✔ ✖
  • B O(n) ✔ ✖
  • C O(n log n) ✔ ✖
  • D O(1) ✔ ✖
Correct Answer

Explanation

Answer: a) O(log n)
 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is an AVL tree? What is a full binary tree? Which of the following is an example of a trie? What is a perfect binary tree? What is a binary tree? What is a heap? Which of the following operations can be performed in O(log n) time on a balanced binary search tree? What is a threaded binary tree? What is a leaf node in a tree? What is a red-black tree?