Binary Tree Zigzag Level Order Traversal

(i. e. , from left to right, then right to left for the next level and alternate between). Given a binary tree, write a code to return binary tree zigzag level order traversal of its node’s values. (ie, from left to right, then right to left for the next level and alternate between). In the screenshot below, we have printed the zigzag traversal of a binary tree.