leetcode刷题笔记(Golang)--173. Binary Search Tree Iterator

添加链接描述173. Binary Search Tree Iterator

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

Calling next() will return the next smallest number in the BST.

Example:

BSTIterator iterator = new BSTIterator(root);
iterator.next(); // return 3
iterator.next(); // return 7
iterator.hasNext(); // return true
iterator.next(); // return 9
iterator.hasNext(); // return true
iterator.next(); // return 15
iterator.hasNext(); // return true
iterator.next(); // return 20
iterator.hasNext(); // return false

Note:

next() and hasNext() should run in average O(1) time and uses O(h) memory, where h is the height of the tree.
You may assume that next() call will always be valid, that is, there will be at least a next smallest number in the BST when next() is called.

type BSTIterator struct {
	Stack []*TreeNode
	Node  *TreeNode
}

func Constructor(root *TreeNode) BSTIterator {
    BSTIt := BSTIterator{Stack:[]*TreeNode{},Node:root}
	for root !=nil {
		BSTIt.Stack = append(BSTIt.Stack,root)
		root = root.Left
	}
    return BSTIt
}

/** @return the next smallest number */
func (this *BSTIterator) Next() int {
    if this.HasNext() {
		res := this.Stack[len(this.Stack)-1]
		this.Stack = this.Stack[:len(this.Stack)-1]
		if res.Right!=nil  {
			node := res.Right
			for node != nil {
				this.Stack = append(this.Stack,node)
				node = node.Left
			}
		}
		return res.Val
	}
    return -1
}

/** @return whether we have a next smallest number */
func (this *BSTIterator) HasNext() bool {
	if len(this.Stack) > 0 {
		return true
	} else {
		return false
	}
}