Best case scenario in printing levels

#1

As discussed that worst case complexity comes when it is a skew tree but what is situation of best case scenario.
Please explain the solution in detail

#2

hello @Sachita3

in the case of hight balanced trees the best scenario will occur , because they have minimum height (due to equal distribtion of nodes across all brances)

#3

Ok got it. then what will be the time complexity in the best case scenario

#4

@Sachita3

it will be O(number of leaves * height of tree) .