top-interview-questions/medium/trees_and_graphs/01_binary_tree_inorder_traversal.cc


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

/**
 * 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:
    void inorder(TreeNode* node, vector<int>& vals) {
        if (node == nullptr) return;

        inorder(node->left, vals);
        vals.push_back(node->val);
        inorder(node->right, vals);
    }

    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> vals;
        inorder(root, vals);
        return vals;
    }
};