Leetcode
2020.05.04 09:30

897. Increasing Order Search Tree

조회 수 555 추천 수 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 720. Longest Word in Dictionary hooni 2020.05.07 691
76 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 591
75 Leetcode 56. Merge Intervals hooni 2020.05.05 550
74 Leetcode 844. Backspace String Compare hooni 2020.05.05 559
73 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 574
72 Leetcode 697. Degree of an Array hooni 2020.05.05 649
71 Leetcode 605. Can Place Flowers hooni 2020.05.05 560
70 Leetcode 724. Find Pivot Index hooni 2020.05.05 579
69 Leetcode 448. Find All Numbers Disappeared in an Array hooni 2020.05.05 528
68 Leetcode 628. Maximum Product of Three Numbers hooni 2020.05.05 535
67 Leetcode 532. K-diff Pairs in an Array hooni 2020.05.04 588
» Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 555
65 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 543
64 Leetcode 876. Middle of the Linked List hooni 2020.05.04 533
63 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 520
62 Leetcode 997. Find the Town Judge hooni 2020.05.02 578
61 Leetcode 270. Closest Binary Search Tree Value hooni 2020.05.01 517
60 Leetcode 687. Longest Univalue Path hooni 2020.05.01 588
59 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 601
58 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree file hooni 2020.05.01 587
Board Pagination Prev 1 2 3 4 Next
/ 4