897. 递增顺序搜索树

给你一棵二叉搜索树，请你 按中序遍历 将其重新排列为一棵递增顺序搜索树，使树中最左边的节点成为树的根节点，并且每个节点没有左子节点，只有一个右子节点。

示例 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

解答

中序遍历：

class Solution {
public:
    TreeNode* increasingBST(TreeNode* root) {
        TreeNode* dummy = new TreeNode(0);
        TreeNode* pre = dummy;
        stack<TreeNode*> s;
        while(!s.empty() || root){
            while(root){
                s.push(root);
                root = root->left;
            }
            root = s.top();
            s.pop();
            root->left = nullptr;
            pre->right = root;
            pre = pre->right;
            root = root->right;
        }
        return dummy->right;
    }
};

递归：

class Solution {
public:
    TreeNode *dummy, *pre;
    TreeNode* increasingBST(TreeNode* root) {
        dummy = new TreeNode(0);
        pre = dummy;
        helper(root);
        return dummy->right;
    }
    void helper(TreeNode* node){
        if(!node)
            return;
        helper(node->left);

        node->left = nullptr;
        pre->right = node;
        pre = pre->right;

        helper(node->right);
    }
};