[LeetCode Road] Binary Tree Inorder Traversal - Solution/C++

107. Binary Tree Level Order Traversal II

Question:

Given the root of a binary tree, return the inorder traversal of its nodes' values.

Example:

Constraints:

Source code

Version 1

Idea:

/**
 * 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:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        inorderTraversal(root, res);
        return res;
    }
private:
    void inorderTraversal(TreeNode* root, vector<int>& res){
        if(!root) return;
        inorderTraversal(root->left, res);
        res.push_back(root->val);
        inorderTraversal(root->right, res);
    }
};