class Solution {
TreeNode curr;
public TreeNode increasingBST(TreeNode root) {
TreeNode first = new TreeNode(-1);
//用first 来记录curr的初始位置
curr = first;
dfs(root);
return first.right;
}
private void dfs(TreeNode node){
if(node == null) return;
dfs(node.left);
curr.right = new TreeNode(node.val);
//指针向树的右边移动
curr = curr.right;
dfs(node.right);
}
}