【刷leetcode，拿Offer-030】94. Binary Tree Inorder Traversal

题目链接：https://leetcode.com/problems/binary-tree-inorder-traversal/

题面：

94. Binary Tree Inorder Traversal

Medium

166372FavoriteShare

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

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

Follow up: Recursive solution is trivial, could you do it iteratively?

题意：

中序遍历。

代码：

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector <int> ans,tmp;
        if(root==NULL)return ans;
        tmp=inorderTraversal(root->left);
        for(int i=0;i<tmp.size();i++)
            ans.push_back(tmp[i]);
        ans.push_back(root->val);
        tmp=inorderTraversal(root->right);
        for(int i=0;i<tmp.size();i++)
            ans.push_back(tmp[i]);
        return ans;
    }
};