二叉树前序、中序、后序遍历

//中序
var inorderTraversal = function(root) {
    let stack=[]
    function inorder(root){
        if(!root) return null
        inorder(root.left)
        stack.push(root.val)
        inorder(root.right)
    }
    inorder(root)
    return stack
};