145. Binary Tree Postorder Traversal

https://leetcode.com/problems/binary-tree-postorder-traversal/

Binary Tree Postorder Traversal - LeetCode

 

이진 트리가 주어졌을 때, 모든 노드를 후위 순회(postorder)로 방문한다.

 

/**
 * 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) {
        if (root == nullptr) {
            return v;
        }
        
        if (root->left) {
            postorderTraversal(root->left);
        }
        
        if (root->right) {
            postorderTraversal(root->right);
        }
        
        v.push_back(root->val);
        return v;
    }
private:
    vector<int> v;
};