145-binary-tree-postorder-traversal.md

/**
 * 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 postorderTraversal = function(root) {
    let result = [];
    let inOrder = function (root) {
        if (!root) return;
        inOrder(root.left);
        inOrder(root.right);
        result.push(root.val);
    }
    inOrder(root);
    return result;
};