从零开始Leetcode – Day 17
Binary Tree Inorder Traversal
https://leetcode.com/problems/binary-tree-inorder-traversal/
明天写非递归。
、、、
/**
- @param {TreeNode} root
- @return {number[]}
*/
var inorderTraversal = function(root) {
var res = [];
helper(root, res);
return res;
};
var helper = function(root, res){
if(root === null){
return;
}
helper(root.left, res);
res.push(root.val);
helper(root.right, res);
}
、、、