897. Increasing Order Search Tree

897. Increasing Order Search Tree
     Easy

Given a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.

Example 1:
Input: [5,3,6,2,4,null,8,1,null,null,null,7,9]

   5
  / \
3    6

/ \
2 4 8
/ / \
1 7 9

Output: [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]

1

2

3

4

5

6

7

8

9

Constraints:

The number of nodes in the given tree will be between 1 and 100.
Each node will have a unique integer value from 0 to 1000.

class Solution {
public:
    vector<int>sequence;//中序序列
    void inorder(TreeNode* root)
    {
        if(root)
        {
            inorder(root->left);
            sequence.push_back(root->val);
            inorder(root->right);
        }
    }
    TreeNode* increasingBST(TreeNode* root) {
        if(!root) return NULL;
        inorder(root);//得到中序序列
        //用中序序列建立BST
        TreeNode* t=NULL;
        for(int i=0;i<sequence.size();i++)
            t=BST(t,sequence[i]);
        return t;
    }
    TreeNode* BST(TreeNode* root,int x)
    {//往树中插入新结点并返回根结点
        if(!root) root=new TreeNode(x);
        else
        {
            if(root->val<x) root->right=BST(root->right,x);
            if(root->val>x) root->left=BST(root->left,x);
        }
        return root;
    }
    
};