JavaScript二叉树的遍历（前序，中序，后序，层序）

一、二叉树的前序遍历

【leetcode前序遍历】https://leetcode.cn/problems/binary-tree-preorder-traversal/

1、递归

/**
 * 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 preorderTraversal = function(root) {
    let res=[];
    const preOrder=(root)=>{
        if(!root) return res
            res.push(root.val);
            preOrder(root.left);
            preOrder(root.right);
    }
    preOrder(root);
    return res;
};

2、迭代

var preorderTraversal = function(root) {
    let res=[];
    if(!root)