/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void in_order(TreeNode* root,vector<int> &num)
{
if(root==NULL)return;
if(root->left!=NULL){
in_order(root->left,num);
}
num.push_back(root->val);
if(root->right!=NULL){
in_order(root->right,num);
}
}
TreeNode* increasingBST(TreeNode* root) {
vector<int> num;
in_order(root,num);
TreeNode * newroot,*q;
newroot = new TreeNode(num[0]);
newroot->left = NULL;
q = newroot;
for(int i =1;i<num.size();i++)
{
TreeNode *p;
p = new TreeNode(num[i]);
q->right = p;
p->left = NULL;
q = q->right;
}
return newroot;
}
};