A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is
a. O(lg n)
b. O(n lg n)
c. O(n)
d. O(n^2)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: