题目描述:
给你一棵二叉搜索树的 root ,请你 按中序遍历 将其重新排列为一棵递增顺序搜索树,使树中最左边的节点成为树的根节点,并且每个节点没有左子节点,只有一个右子节点。
示例 1:
输入:root = [5,3,6,2,4,null,8,1,null,null,null,7,9]
输出:[1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]
示例 2:
输入:root = [5,1,7]
输出:[1,null,5,null,7]
提示:
树中节点数的取值范围是 [1, 100]
0 <= Node.val <= 1000
c++代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> v;
void solve(TreeNode* root){
if(root==nullptr)return;
solve(root->left);
v.push_back(root->val);
solve(root->right);
}
TreeNode* increasingBST(TreeNode* root) {
if(root==nullptr)return nullptr;
solve(root);
TreeNode* root2 = new TreeNode(0);
TreeNode* r = root2;
for(int i=0;i<v.size();i++){
TreeNode* node = new TreeNode(v[i]);
root2->right = node;
root2=root2->right;
}
return r->right;
}
};