问:给你一棵二叉搜索树,请你 按中序遍历 将其重新排列为一棵递增顺序搜索树,使树中最左边的节点成为树的根节点,并且每个节点没有左子节点,只有一个右子节点。
例:
输入: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]
原题链接:https://leetcode.cn/problems/increasing-order-search-tree/
答:
/**
* 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<Integer>();//定义一个列表
public TreeNode increasingBST(TreeNode root) {
inOrderTraversal(root);
TreeNode tr = new TreeNode(-1);
TreeNode tr1 = tr;
for(int value:list)
{
tr1.right = new TreeNode (value);//把列表中的数据存放到新的书中的右节点
tr1 = tr1.right;
}
return tr.right;
}
public void inOrderTraversal(TreeNode root)//中序遍历
{
if(root == null)
return;
//左中右
inOrderTraversal(root.left);
list.add(root.val);
inOrderTraversal(root.right);
}
}