Files
LeetCode-Go/leetcode/0173.Binary-Search-Tree-Iterator/173. Binary Search Tree Iterator_test.go
2020-08-07 17:06:53 +08:00

30 lines
708 B
Go

package leetcode
import (
"fmt"
"testing"
"github.com/halfrost/LeetCode-Go/structures"
)
func Test_Problem173(t *testing.T) {
root := structures.Ints2TreeNode([]int{9, 7, 15, 3, structures.NULL, structures.NULL, 20})
obj := Constructor173(root)
fmt.Printf("obj = %v\n", obj)
param1 := obj.Next()
fmt.Printf("param_1 = %v\n", param1)
param2 := obj.HasNext()
fmt.Printf("param_2 = %v\n", param2)
param1 = obj.Next()
fmt.Printf("param_1 = %v\n", param1)
param1 = obj.Next()
fmt.Printf("param_1 = %v\n", param1)
param1 = obj.Next()
fmt.Printf("param_1 = %v\n", param1)
param1 = obj.Next()
fmt.Printf("param_1 = %v\n", param1)
param2 = obj.HasNext()
fmt.Printf("param_2 = %v\n", param2)
}