Statement You are given a binary tree. Print the level ortier traversal in the spiral tam of the given lenary teen Towel der alt depth, first the root, then the child of the root, etc. Note: If the height of the tree is given as I', print "MAL". Start traversing from the root node of the input tree and the direction of the fint move is towards the left chaild of the Input Format: The input consists of two lines: The first line contains an integer representing the height of the binary tree The second line contains space separated integers denoting the level order travornal of the ren, hodin witty