Binary Tree Postorder Traversal LeetCode solution in C++

1
class Solution {
2
  void solve(TreeNode *root, vector<int> &ans) {
3
    if (root == NULL) return;
4
    solve(root->left, ans);
5
    solve(root->right, ans);
6
    ans.push_back(root->val);
7
  }
8

9
 public:
10
  vector<int> postorderTraversal(TreeNode *root) {
11
    vector<int> ans;
12
    solve(root, ans);
13
    return ans;
14
  }
15
};