二叉树的中序遍历

var inorderTraversal = function(root) {
    const arr = [];
	const inOrder = (root) => {
        if(!root) return;
        inOrder(root.left);
        arr.push(root.val);
        inOrder(root.right);
    }
    inOrder(root);
    return arr;
}