173 accepted. 44ms

Author: aQuaYi

Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go

@@ -1,6 +1,8 @@
 package problem0173
 
-import "github.com/aQuaYi/LeetCode-in-Go/kit"
+import (
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+)
 
 // TreeNode is pre-defined...
 /* Definition for a binary tree node.
@@ -42,6 +44,7 @@ func (it *BSTIterator) HasNext() bool {
 
 func convert(root *TreeNode) []int {
 	res := make([]int, 0, 128)
+	helper(root, &res)
 	return res
 }
 

Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator_test.go

@@ -15,13 +15,12 @@ func Test_BSTIterator(t *testing.T) {
 	root := kit.Ints2TreeNode(ints)
 
 	it := Constructor(root)
+	nums := kit.Tree2Inorder(root)
 
 	i := 0
 
 	for it.HasNext() {
-		for ints[i] == kit.NULL {
-			i++
-		}
-		ast.Equal(ints[i], it.Next(), "%d", ints[i])
+		ast.Equal(nums[i], it.Next(), "%d", nums[i])
+		i++
 	}
 }