Leetcode
2020.05.04 09:30

897. Increasing Order Search Tree

조회 수 642 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.

Example 1:
Input: [5,3,6,2,4,null,8,1,null,null,null,7,9]

       5
      / \
    3    6
   / \    \
  2   4    8
 /        / \ 
1        7   9

Output: [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]

 1
  \
   2
    \
     3
      \
       4
        \
         5
          \
           6
            \
             7
              \
               8
                \
                 9  

 

Constraints:

  • The number of nodes in the given tree will be between 1 and 100.
  • Each node will have a unique integer value from 0 to 1000.


/**
 * 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 {
    TreeNode result;
    TreeNode curr;
    
    public TreeNode increasingBST(TreeNode root) {
        makeFlatInOrder(root);
        
        return result;
    }
    
    public void makeFlatInOrder(TreeNode node){
        if(node == null){
            return;
        }
        
        makeFlatInOrder(node.left);
        
        if(curr == null){
            result = new TreeNode(node.val);
            curr = result;
        }else{
            curr.right = new TreeNode(node.val);
            curr = curr.right;
        }
        
        makeFlatInOrder(node.right);
    }
}


/**
 * 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<TreeNode> list = new ArrayList<>();
        
        inOrder(root, list);
        
        TreeNode node = new TreeNode(-1);
        TreeNode curr = node;
        
        for(TreeNode item : list){
            curr.right = new TreeNode(item.val);
            curr = curr.right;
        }
        
        return node.right;
    }
    
    public void inOrder(TreeNode node, List<TreeNode> list){
        if(node == null){
            return;
        }
        
        inOrder(node.left, list);
        
        list.add(node);
        
        inOrder(node.right, list);
    }
}

[문제] https://leetcode.com/problems/increasing-order-search-tree/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode [todo] 687. Longest Univalue Path hooni 2020.05.01 199
76 Programmers team game secret hooni 2020.04.30 0
75 Programmers hashmap secret hooni 2020.04.30 0
74 Programmers fib secret hooni 2020.04.30 0
73 Leetcode 997. Find the Town Judge hooni 2020.05.02 670
72 Leetcode 994. Rotting Oranges file hooni 2020.04.14 152
71 Leetcode 993. Cousins in Binary Tree file hooni 2020.04.30 209
70 Leetcode 973. K Closest Points to Origin hooni 2020.04.15 149
69 Leetcode 946. Validate Stack Sequences hooni 2020.04.08 145
68 Leetcode 937. Reorder Data in Log Files hooni 2020.04.25 153
» Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 642
66 Leetcode 876. Middle of the Linked List hooni 2020.05.04 629
65 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 629
64 Leetcode 852. Peak Index in a Mountain Array hooni 2020.04.28 147
63 Leetcode 844. Backspace String Compare hooni 2020.05.05 672
62 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 685
61 Leetcode 763. Partition Labels hooni 2020.04.17 204
60 Leetcode 75. Sort Colors hooni 2020.04.14 137
59 Leetcode 731. My Calendar II hooni 2020.04.15 137
58 Leetcode 729. My Calendar I hooni 2020.04.15 140
Board Pagination Prev 1 2 3 4 Next
/ 4