求preorder,没啥好说的
/**
* 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>ve;
void preo(TreeNode* root){
if(root == NULL) return ;
ve.push_back(root -> val);
preo(root -> left);
preo(root -> right);
}
vector<int> preorderTraversal(TreeNode* root) {
preo(root);
return ve;
}
};