/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
void InOrder(TreeNode *root,vector<int> &vec){
if(root==NULL)return;
InOrder(root->left,vec);
vec.push_back(root->val);
InOrder(root->right,vec);
}
public:
vector<int> inorderTraversal(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> vec;
InOrder(root,vec);
return vec;
}
};
Binary Tree Inorder Traversa
最新推荐文章于 2019-04-27 08:26:04 发布