执行用时: 0 ms
内存消耗: 9.2 MB
/**
* 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 {
private:
//初始化访问节点 到时候需要即压入栈
vector<int> res;
public:
vector<int> inorderTraversal(TreeNode* root) {
if (root != NULL) {
inorderTraversal(root->left);
res.push_back(root->val);
inorderTraversal(root->right);
}
return res;
}
};