Leetcode
2020.05.04 09:30

# 897. Increasing Order Search Tree

조회 수 687 추천 수 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);

inOrder(node.right, list);
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 720. Longest Word in Dictionary 2020.05.07 846
76 Leetcode 225. Implement Stack using Queues 2020.05.05 740
75 Leetcode 56. Merge Intervals 2020.05.05 691
74 Leetcode 844. Backspace String Compare 2020.05.05 748
73 Leetcode 222. Count Complete Tree Nodes 2020.05.05 713
72 Leetcode 697. Degree of an Array 2020.05.05 786
71 Leetcode 605. Can Place Flowers 2020.05.05 697
70 Leetcode 724. Find Pivot Index 2020.05.05 716
69 Leetcode 448. Find All Numbers Disappeared in an Array 2020.05.05 682
68 Leetcode 628. Maximum Product of Three Numbers 2020.05.05 672
67 Leetcode 532. K-diff Pairs in an Array 2020.05.04 728
» Leetcode 897. Increasing Order Search Tree 2020.05.04 687
65 Leetcode 872. Leaf-Similar Trees 2020.05.04 679
64 Leetcode 876. Middle of the Linked List 2020.05.04 678
63 Leetcode 203. Remove Linked List Elements 2020.05.04 653
62 Leetcode 997. Find the Town Judge 2020.05.02 718
61 Leetcode 270. Closest Binary Search Tree Value 2020.05.01 659
60 Leetcode 687. Longest Univalue Path 2020.05.01 717
59 Leetcode 783. Minimum Distance Between BST Nodes 2020.05.01 728
58 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree 2020.05.01 721
Board Pagination Prev 1 2 3 4 Next
/ 4