LC 94. Binary Tree Inorder Traversal
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
| /**
* 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 inorder = (root) => {
if (!root) return
inorder(root.left)
res.push(root.val)
inorder(root.right)
}
inorder(root)
return res
};
|
评论和交流请发送邮件到 me@tianhegao.com