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.

Note: next() and hasNext() should run in average O(1) time and uses O(h) memory, where h is the height of the tree.

<pre name="code" class="cpp">class BSTIterator {
public:
	stack<TreeNode* > m_stkNode;
    BSTIterator(TreeNode *root) 
	{
		inorderVisit(root);
    }

    /** @return whether we have a next smallest number */
    bool hasNext() 
	{
        return !m_stkNode.empty();
    }

    /** @return the next smallest number */
    int next() 
	{

        TreeNode *node = m_stkNode.top();
		m_stkNode.pop();
		inorderVisit(node->right);
		return node->val;
    }
	void inorderVisit(TreeNode *node)
	{
		while(node != 0)
		{
			m_stkNode.push(node);
			node = node->left;
		}
	}
};