269 views

2 Answers

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.

No related questions found