二叉树的锯齿形层序遍历

https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[][]}
 */
var zigzagLevelOrder = function(root) {
        
    let result=[]

    if(!root){
        return []
    }
    let isOrderLeft = true;

    let levelRootList=[root]

    while (levelRootList.length) {
        
        let levelValues=[]
        let count=levelRootList.length
        for(i=0;i<count;i++){
            
            let node = levelRootList.shift()
            levelValues.push(node.val)
            
            if(node.left){ levelRootList.push(node.left) }
            if(node.right){ levelRootList.push(node.right) }
        }

        if(!isOrderLeft){ levelValues.reverse() }
        result.push(levelValues)
        isOrderLeft=!isOrderLeft
    }

    return result

}