Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 145. Binary Tree Postorder Traversal

---

題目：


解答：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> ans;

        auto dfs = [&](this auto&& dfs, TreeNode* n) {
            if (!n) {
                return;
            }

            dfs(n->left);
            dfs(n->right);
            ans.push_back(n->val);
        };

        dfs(root);
        return ans;
    }
};