/
solution.ts
37 lines (34 loc) · 1.16 KB
/
solution.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
// #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 }