0 votes 0 votes 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) Kushagra1234 asked Nov 16, 2018 Kushagra1234 269 views answer comment Share Follow See 1 comment See all 1 1 comment reply kumar.dilip commented Nov 16, 2018 reply Follow Share See Here good Explanation https://gateoverflow.in/69942/ugcnet-aug2016-ii-23 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 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. goxul answered Nov 16, 2018 goxul comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer: O(n) Shamim Ahmed answered Nov 16, 2018 Shamim Ahmed comment Share Follow See all 0 reply Please log in or register to add a comment.