题目:
给你一棵二叉搜索树,请你 按中序遍历 将其重新排列为一棵递增顺序搜索树,使树中最左边的节点成为树的根节点,并且每个节点没有左子节点,只有一个右子节点。
示例 1:
输入:root = [5,3,6,2,4,null,8,1,null,null,null,7,9]
输出:[1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]
最终代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
List<Integer> list=new ArrayList<>();
public TreeNode increasingBST(TreeNode root) {
BST(root);
for(Integer bt:list){
System.out.println(bt);
}
TreeNode result=new TreeNode(list.get(0));
TreeNode p=result;
for(int i=1;i<list.size();i++){
p.left=null;
p.right=new TreeNode(list.get(i));
p=p.right;
}
return result;
}
public void BST(TreeNode root){
if(root!=null){
BST(root.left);
//System.out.println(root.val);
list.add(root.val);
BST(root.right);
}
return;
}
}