乐扣简单题（94）js--二叉树的中序遍历

中序遍历可以有递归方法和非递归方法

解法一：递归方法

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

解法二：非递归方法

/**
 * 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 inorderTraversal = function(root) {
    if(!root) {return [];}
    const stack=[];
    const res=[];
    let p=root;
    while(stack.length || p) {
        while(p) {
            stack.push(p);
            p=p.left;
        }
        const n=stack.pop();
        res.push(n.val)
        p=n.right
    }
    return res
};