Lstmxx的空间

103. 二叉树的锯齿形层序遍历

给定一个二叉树，返回其节点值的锯齿形层序遍历。（即先从左往右，再从右往左进行下一层遍历，以此类推，层与层之间交替进行）。

链接

function zigzagLevelOrder(root: TreeNode | null): number[][] {
  if (root === null) return []
  const nodeList: Array<TreeNode | null> = [root]
  let isResverse = false
  const res = []
  while(nodeList.length > 0) {
    const method = isResverse ? Array.prototype.unshift : Array.prototype.push
    isResverse = !isResverse
    if (nodeList.length === 1) {
      const parent = nodeList.shift()
      nodeList.push(parent.left)
      nodeList.push(parent.right)
      res.push([parent.val])
    } else {
      const nodeL = nodeList.splice(0)
      const len = nodeL.length
      const valList = []
      for(let i = 0; i < len;i++) {
        const node = nodeL[i]
        if (node) {
          method.call(valList, node.val)
          nodeList.push(node.left)
          nodeList.push(node.right)
        }
      }
      valList.length > 0 && res.push(valList)
    }
  }
  return res
}