/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
TreeNode root0 = new TreeNode(0);
TreeNode current = root0;
private void inOrder(TreeNode node) {
if(node!=null) {
inOrder(node.left);
current.right = new TreeNode(node.val);
current = current.right;
inOrder(node.right);
}
}
public TreeNode increasingBST(TreeNode root) {
inOrder(root);
return root0.right;
}
}