ibps2014

Question

the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is

1. o (n log n)

2. o (n)

3. o(sqrt(n))

4. o (log n)

Comments

See Here good Explanation 

https://gateoverflow.in/69942/ugcnet-aug2016-ii-23

Answer 1

In-order traversal takes $O(n)$ time as the recursive function is called $n$ times and in each call, only a constant amount of work done.

Answer 2

Answer: O(n)