2022-09-28

[Zheaoli]

2022-09-28

[Dapeus]

[gongpeione]

/*
 * @lc app=leetcode id=94 lang=typescript
 *
 * [94] Binary Tree Inorder Traversal
 */

// @lc code=start
/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     val: number
 *     left: TreeNode | null
 *     right: TreeNode | null
 *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 *         this.val = (val===undefined ? 0 : val)
 *         this.left = (left===undefined ? null : left)
 *         this.right = (right===undefined ? null : right)
 *     }
 * }
 */

function inorderTraversal(root: TreeNode | null): number[] {
    const inorder = [];

    const walk = (node: TreeNode | null) => {
        if (!node) return;
        if (node.left) {
            walk(node.left);
        }
        inorder.push(node.val);
        if (node.right) {
            walk(node.right);
        }
    }

    walk(root);

    return inorder;
};
// @lc code=end

---

微信id: 弘树 来自 vscode 插件