题目描述:
解题思路:
先中序遍历保存所有节点的信息,然后模拟构建。
List<Integer> list=new ArrayList<>();
public TreeNode increasingBST(TreeNode root) {
LDR(root);
TreeNode resTree=new TreeNode(list.get(0));
TreeNode temp=resTree;
for (int i = 1; i < list.size(); i++) {
temp.left=null;
temp.right=new TreeNode(list.get(i));
temp=temp.right;
}
return resTree;
}
private void LDR(TreeNode root){
if(root==null) return;
LDR(root.left);
list.add(root.val);
LDR(root.right);
}