(LeetCode) 145. Binary Tree Postorder Traversal

문제 링크

• LeetCode

요약

• Postorder 구현 문제

최종 §

결과

• 그냥 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 {
	void traverse(TreeNode *root, vector<int> &store) {
		if (!root) {
			return;
		}
 
		traverse(root->left, store);
		traverse(root->right, store);
		store.push_back(root->val);
	}
public:
	vector<int> postorderTraversal(TreeNode* root) {
		vector<int> ret;
 
		traverse(root, ret);
 
		return ret;
	}
};