0094-binary-tree-inorder-traversal.cpp

/**
 * 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 inorderTraversal(TreeNode *root, vector<int> &ans) {
    if (root == nullptr) return;
    inorderTraversal(root->left, ans);
    ans.push_back(root->val);
    inorderTraversal(root->right, ans);
  }

 public:
  vector<int> inorderTraversal(TreeNode *root) {
    vector<int> ans;
    inorderTraversal(root, ans);
    return ans;
  }
};