Leetcode 897. Increasing Order Search Tree
题目链接: Increasing Order Search Tree
难度:Easy
题目大意:
将二叉树的节点进行重新排列。
思路:
其实就是中序遍历,我采用的方法是先对二叉树进行中序遍历,然后重新构建一棵新的二叉树,这么做空间复杂度较高。还有一种方法是直接在原来的二叉树上进行重构。
代码
/**
* 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 {
public TreeNode increasingBST(TreeNode root) {
List<Integer> list=new ArrayList<Integer>();
inorder(root,list);
TreeNode res=new TreeNode(0),temp=res;
for(int val:list){
temp.right=new TreeNode(val);
temp=temp.right;
}
return res.right;
}
private void inorder(TreeNode root,List<Integer> list){
if(root!=null){
if(root.left!=null){
inorder(root.left,list);
}
list.add(root.val);
if(root.right!=null){
inorder(root.right,list);
}
}
}
}