剑指 Offer II 052. 展平二叉搜索树 - 力扣(LeetCode) (leetcode-cn.com)
class Solution {
TreeNode*pre;
public:
TreeNode* increasingBST(TreeNode* root) {
TreeNode*head=new TreeNode(0);
pre=head;
fun(root);
return head->right;
}
void fun(TreeNode*root){
if(root==nullptr) return;
fun(root->left);
pre->right=new TreeNode(root->val);
pre=pre->right;
fun(root->right);
}
};