Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Definition for a binary tree node.
- * struct TreeNode {
- * int val;
- * TreeNode *left;
- * TreeNode *right;
- * TreeNode(int x) : val(x), left(NULL), right(NULL) {}
- * };
- */
- class Solution {
- public:
- vector<int> postorderTraversal(TreeNode* root) {
- vector<int> res;
- stack<TreeNode*> st;
- if(root == NULL) return res;
- st.push(root);
- while(!st.empty()){
- TreeNode* temp = st.top();
- st.pop();
- res.push_back(temp->val);
- if(temp->left != NULL)
- st.push(temp->left);
- if(temp->right != NULL)
- st.push(temp->right);
- }
- reverse(res.begin(), res.end());
- return res;
- }
- };
Add Comment
Please, Sign In to add comment