剑指 Offer II 052. 展平二叉搜索树
给你一棵二叉搜索树,请 按中序遍历 将其重新排列为一棵递增顺序搜索树,使树中最左边的节点成为树的根节点,并且每个节点没有左子节点,只有一个右子节点。
示例 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]
示例 2:
输入:root = [5,1,7]
输出:[1,null,5,null,7]
提示:
树中节点数的取值范围是 [1, 100]
0 <= Node.val <= 1000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/NYBBNL
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
分析
由于展平二叉树每个节点只有右子节点,新建一棵树直接中序遍历把节点按顺序放在树的右边即可。
题解(Java)
/**
* 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 {
private TreeNode ans = new TreeNode();
private TreeNode temp = new TreeNode();
public TreeNode increasingBST(TreeNode root) {
temp = ans;
dfs(root);
return ans.right;
}
private void dfs(TreeNode root) {
if (root == null) {
return;
}
dfs(root.left);
TreeNode node = new TreeNode(root.val);
temp.right = node;
temp = temp.right;
dfs(root.right);
}
}