力扣897. 递增顺序搜索树

class Solution {
public:
    void dfs(TreeNode* root,vector<int>& v){
        if(root==nullptr)return ;
        dfs(root->left,v);
        v.push_back(root->val);
        dfs(root->right,v);
    }
    TreeNode* increasingBST(TreeNode* root) {
        vector<int>v;
        dfs(root,v);
        TreeNode* ptr =new TreeNode(-1);
        auto currnode =ptr;
        //建一个新树
        for(int i:v){
            currnode->right=new TreeNode(i);
            currnode=currnode->right;
        }
        return ptr->right;
    }
};