897 added

Author: aQuaYi

Algorithms/0897.increasing-order-search-tree/README.md

@@ -0,0 +1,47 @@
+# [897. Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)
+
+## 题目
+
+Given a 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.
+
+```text
+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
+```
+
+Note:
+
+- 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.
+
+## 解题思路
+
+见程序注释

Algorithms/0897.increasing-order-search-tree/increasing-order-search-tree.go

@@ -0,0 +1,16 @@
+package problem0897
+
+import "github.com/aQuaYi/LeetCode-in-Go/kit"
+
+// TreeNode Definition for a binary tree node.
+// type TreeNode struct {
+//     Val int
+//     Left *TreeNode
+//     Right *TreeNode
+// }
+type TreeNode = kit.TreeNode
+
+func increasingBST(root *TreeNode) *TreeNode {
+
+	return nil
+}

Algorithms/0897.increasing-order-search-tree/increasing-order-search-tree_test.go

@@ -0,0 +1,45 @@
+package problem0897
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+	"github.com/stretchr/testify/assert"
+)
+
+var null = kit.NULL
+
+// tcs is testcase slice
+var tcs = []struct {
+	p   []int
+	ans []int
+}{
+
+	{
+		[]int{5, 3, 6, 2, 4, null, 8, 1, null, null, null, 7, 9},
+		[]int{1, null, 2, null, 3, null, 4, null, 5, null, 6, null, 7, null, 8, null, 9},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_increasingBST(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		root := kit.Ints2TreeNode(tc.p)
+		ans := kit.Ints2TreeNode(tc.ans)
+		ast.Equal(ans, increasingBST(root), "输入:%v", tc)
+	}
+}
+
+func Benchmark_myFunc(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			root := kit.Ints2TreeNode(tc.p)
+			increasingBST(root)
+		}
+	}
+}

leetcode.json

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 819,
-	"Updated": "2018-10-07T10:35:14.897835145+08:00",
+	"Updated": "2018-10-07T10:36:49.583385931+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 198,