Your Task: You don't have to take any input. Complete the function levelOrder() that takes the root node as input parameter and returns a list of integers containing the level order traversal of the given Binary Tree.
Expected Time Complexity: O(N) Expected Auxiliary Space: O(N)
1 ≤ Number of nodes ≤ 105
1 ≤ Data of a node ≤ 105