Level order printing of binary tree by recursion

#1

why does taking skew tree give the worst time complexity. shouldn’t it be worse when the tree Is completely full?

#2

hello @chinmay_mittal

complexity will depend on height of the tree right?

for skew tree height will be n .

but for full binary tree height will less than n

#3

Thanks I thought n was number of levels forget that it was number of elements