leetcode || 103、Binary Tree Zigzag Level Order Traversal
problem:Givenabinarytree,returnthe zigzaglevelorder traversalofitsnodes'values.(ie,fromlefttoright,thenrighttoleftforthenextlevelandalternatebetween).Forexample:Givenbinarytree {3,9,20,#,#,15,7},3
/\