//这种方法返回的是vector,代码量多,第二种方法返回void,传入的是vector<>,运行快,代码量少。
vector<int> getnode(TreeNode* root) {
vector<int> vec;
vector<int> tmp;
if (root == NULL) return vec;
else {
tmp = getnode(root->left);
if(!tmp.empty())
vec.insert(vec.end(), tmp.begin(), tmp.end());
vec.push_back(root->val);
tmp = getnode(root->right);
if (!tmp.empty())
vec.insert(vec.end(), tmp.begin(), tmp.end());
}
return vec;
}
TreeNode* increasingBST(TreeNode* root) {
if (root == NULL)
return root;
vector<int> res = getnode(root);
TreeNode* nroot = new TreeNode(res[0]);
TreeNode* resroot = nroot;
for (int i = 1; i < res.size(); i++) {
nroot->right = new TreeNode(res[i]);
nroot->left = NULL;
nroot = nroot->right;
}
return resroot;
}
2.
/**
* 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:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
TreeNode* increasingBST(TreeNode* root) {
vector<int> value;
increasingBST(root,value);
TreeNode* newRoot=new TreeNode(value[0]);
TreeNode* p=newRoot;
for(int i=1;i<value.size();i++){
p->left=0;
p->right=new TreeNode(value[i]);
p=p->right;
}
return newRoot;
}
void increasingBST(TreeNode* root,vector<int> &value){
if(root){
increasingBST(root->left,value);
value.push_back(root->val);
increasingBST(root->right,value);
}
}
};