[leetcode]94. Binary Tree Inorder Traversal

[leetcode]94. Binary Tree Inorder Traversal

---

Analysis

想把拖鞋赛道实验室某男生嘴里！！！—— [生气气]

Given a binary tree, return the inorder traversal of its nodes’ values.
中序遍历保存节点值。。。

Implement

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