The task is to complete the function findSpiral() which takes root node as input parameter and returns the elements in spiral form of level order traversal as a list. The newline is automatically appended by the driver code. Expected Time Complexity: O(N). Expected Auxiliary Space: O(N).
0 <= Number of nodes <= 105
0 <= Data of a node <= 105