-
Notifications
You must be signed in to change notification settings - Fork 2
/
0897.increasingBST.go
57 lines (44 loc) · 1.13 KB
/
0897.increasingBST.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
package _0897
import (
. "github.com/godcong/leetcode/common"
)
/*
897. 递增顺序搜索树
给你一棵二叉搜索树,请你 按中序遍历 将其重新排列为一棵递增顺序搜索树,使树中最左边的节点成为树的根节点,并且每个节点没有左子节点,只有一个右子节点。
示例 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
*/
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func increasingBST(root *TreeNode) *TreeNode {
vals := []int{}
var inorder func(*TreeNode)
inorder = func(node *TreeNode) {
if node != nil {
inorder(node.Left)
vals = append(vals, node.Val)
inorder(node.Right)
}
}
inorder(root)
dummyNode := &TreeNode{}
curNode := dummyNode
for _, val := range vals {
curNode.Right = &TreeNode{Val: val}
curNode = curNode.Right
}
return dummyNode.Right
}