give root binary tree return zigzag level order traversal nodes value ie leave right right left level alternate Example 1input root 3920nullnull157Output 3209157example 2input root 1Output 1Example 3input root Output ConstraintsThe number nod tree range 0 2000100 Nodeval 100