what is the meaning of the statement that a skew tree has a height of O(N) and a balanced tree has a height O(logN)
What is the meaning of the statement
hello @av8055
trees that looks like a straight line are called skew tree.
ex->
here u can clearly see the height is equal to the number of nodes it has which is O(N).
whereas a balanced tree are trees where nodes are equally distributed in all brances and becuase of that the tree height remains O(log(n) )
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.