题解 | #24.二叉树的中序遍历#
二叉树的中序遍历
http://www.nowcoder.com/practice/0bf071c135e64ee2a027783b80bf781d
递归
function inorderTraversal( root ) {
function inOrder(root){
if(root == null) return;
inOrder(root.left);
ans.push(root.val);
inOrder(root.right);
}
let ans = [];
inOrder(root);
return ans;
}
module.exports = {
inorderTraversal : inorderTraversal
};
快手开奖135人在聊