Complexity of Q3?

#1

How complexity of Q3 is O(n)?As per the calculations ,it should be O(n*log n)

#2

@TusHar-AroRa-2294450460870717,
Which question are you talking about, Q3 is about BST. Copy paste the qn here.

#3

For a perfect binary tree of height h and n nodes the sum of heights of all the nodes is:

#4

O(hh) O(h) O(nn) O(n)

#5

@TusHar-AroRa-2294450460870717,
Just take a small perfect binary tree and verify.