Easy Python solution || Level order traversal
\tdef zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:\n\t\t\tif not root:\n\t\t\t\treturn []\n\t\t\tlevel = 1\n\t\t\tres, curr, nxt = [], [root], [] 
\tdef zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:\n\t\t\tif not root:\n\t\t\t\treturn []\n\t\t\tlevel = 1\n\t\t\tres, curr, nxt = [], [root], [] \n\t\t\twhile curr:\n\t\t\t\tfor i in curr:\n\t\t\t\t\tif i.left:\n\t\t\t\t\t\tnxt.append(i.left)\n\t\t\t\t\tif i.right:\n\t\t\t\t\t\tnxt.append(i.right)\n\t\t\t\tif level%2 == 0:\n\t\t\t\t\tcurr.reverse()\n\t\t\t\tres.append([i.val for i in curr])\n\t\t\t\tcurr = nxt\n\t\t\t\tif nxt:\n\t\t\t\t\tlevel +=1\n\t\t\t\tnxt = []\n\t\t\treturn res\n\t\t\t\nHey you viewer, if you understand my solution, do **UPVOTE**, it motivates me. Keep practicing!!!
['Python', 'Python3']