二叉树的深度优先遍历 以及 广度优先遍历

一、二叉树的深度优先遍历

实际上，二叉树的深度优先遍历和二叉树的前序遍历结果一致，如下：

1、题目地址

https://leetcode-cn.com/problems/binary-tree-preorder-traversal/

2、具体代码

（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[]}
 */
function preTraversal(root, res) {
    if(root === null) {
        return res;
    }
    res.push(root.val);
    preTraversal(root.left, res);
    preTraversal(root.right, res);
}
var preorderTraversal = function(root) {
    let res = [];
    preTraversal(root, res);
    return res;
};

（2）迭代法

/**
 * 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 = [];
    let stack = [root];
    while(stack.length !== 0) {
        let node = stack.pop();
        if(node !== null) {
            res.push(node.val);
        }else {
            continue;
        }
        stack.push(node.right);
        stack.push(node.left);
    }
    return res;
};

二、二叉树的广度优先遍历

实际上，二叉树的广度优先遍历和二叉树的层序遍历结果一致，如下：

/**
 * @param {TreeNode} root
 * @return {number[][]}
 */
var levelOrder = function(root) {
    if(root === null) {
        return [];
    }
    let res = [];
    let queue = [root];
    while(queue.length) {
        let tempArr = [];
        let len = queue.length;
        for(let i=0; i<len; i++) {
            let node = queue.shift();
            tempArr.push(node.val);
            if(node.left) {
                queue.push(node.left);
            }
            if(node.right) {
                queue.push(node.right);
            }
        }
        res.push(tempArr.slice(0));
    }
    return res;
};