173 added

aQuaYi · aQuaYi · commit 105142d89674 · 2019-04-20T22:01:35.000+08:00
diff --git a/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go b/Algorithms/0173.binary-search-tree-iterator/binary-search-tree-iterator.go
@@ -22,13 +22,13 @@ func Constructor(root *TreeNode) BSTIterator {
 	return BSTIterator{}
 }
 
-// Next returns the next smallest number */
+// Next returns the next smallest number
 func (it *BSTIterator) Next() int {
 
 	return 0
 }
 
-// HasNext returns whether we have a next smallest number */
+// HasNext returns whether we have a next smallest number
 func (it *BSTIterator) HasNext() bool {
 
 	return false

Original file line number	Diff line number	Diff line change
`@@ -22,13 +22,13 @@ func Constructor(root *TreeNode) BSTIterator {`
`22`	`22`	`return BSTIterator{}`
`23`	`23`	`}`
`24`	`24`
`25`		`-// Next returns the next smallest number */`
	`25`	`+// Next returns the next smallest number`
`26`	`26`	`func (it *BSTIterator) Next() int {`
`27`	`27`
`28`	`28`	`return 0`
`29`	`29`	`}`
`30`	`30`
`31`		`-// HasNext returns whether we have a next smallest number */`
	`31`	`+// HasNext returns whether we have a next smallest number`
`32`	`32`	`func (it *BSTIterator) HasNext() bool {`
`33`	`33`
`34`	`34`	`return false`