(Javascript)二叉树的非递归遍历——前序、中序、后序

一、二叉树的前序、后序遍历

1、视频解析

（1）前序遍历+后续遍历
https://www.bilibili.com/video/BV15f4y1W7i2?from=search&seid=4673079064082377683
（2）中序遍历
https://www.bilibili.com/video/BV1Zf4y1a77g/?spm_id_from=333.788.recommend_more_video.-1

2、leetcode题目链接

（1）前序遍历题目链接
https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
（2）后序遍历题目链接
https://leetcode-cn.com/problems/binary-tree-postorder-traversal/

3、具体代码

（1）二叉树 前序遍历 迭代法 代码

var preorderTraversal = function(root) {
    let res = [];
    let stack = [];
    stack.push(root);
     while(stack.length) {
        let node = stack.pop();//利用栈实现非递归遍历
        if(node !== null) {
            res.push(node.val);
        }else {
            continue;
        }
        if(node.right) {
            stack.push(node.right);
        }
        if(node.left) {
            stack.push(node.left);
        }
    }
    return res;
};

（2）二叉树 后序遍历 迭代法 代码

// 利用前序遍历(中左右) -> 左右对调(中右左) -> 数组翻转(左右中),即得到后续遍历(左右中)
var postorderTraversal = function(root) {
    let res = [];
    let stack = [];
    stack.push(root);
    while(stack.length) {
        let node = stack.pop();
        if(node !== null) {
            res.push(node.val);
        }else {
            continue;
        }
        if(node.left) {
            stack.push(node.left);
        }
        if(node.right) {
            stack.push(node.right);
        }
    }
    return res.reverse();
};

（3）二叉树 中序遍历 迭代法 代码

var inorderTraversal = function(root) {
    let res = [];
    let stack = [];
    let cur = root;
    while(stack.length !== 0 || cur !== null) {
        if(cur !== null) {
            stack.push(cur);
            cur = cur.left;
        }else {
            cur = stack.pop();
            res.push(cur.val);
            cur = cur.right;
        }
    }
    return res;
};