g0001_0100.s0094_binary_tree_inorder_traversal.solution.ts Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
// #Stack #Data_Structure_I_Day_10_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
// #2023_10_03_Time_45_ms_(97.30%)_Space_42.9_MB_(96.73%)

import { TreeNode } from '../../com_github_leetcode/treenode'

/*
 * 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[] {
    if (!root) return []
    if (!root.val) return []
    const result: number[] = []
    function traverse(node: TreeNode, arr: number[]) {
        if (node.left) {
            traverse(node.left, result)
        }
        result.push(node.val)
        if (node.right) {
            traverse(node.right, result)
        }
    }
    traverse(root, result)
    return result
}

export { inorderTraversal }