Binary Tree - Level Order

[ashwani225 (Ashwani jaiswal)]

In what case will be worst time complexity??

[Mosina_Ashraf]

Time Complexity: O(n^2) in worst case. For a skewed tree, printGivenLevel() takes O(n) time where n is the number of nodes in the skewed tree. So time complexity of printLevelOrder() is O(n) + O(n-1) + O(n-2) + .. + O(1) which is O(n^2) .