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.

Solution: use stack to implement DFS. 

#include <stack>
/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class BSTIterator {
private: 
    stack<TreeNode *> tree;
    TreeNode* _root;
    bool finish = false;
public:
    BSTIterator(TreeNode *root) {
        _root = root;
        if(!root)
             finish = true;
        //insert most left into stack.
        if(tree.empty() && !finish)
        {
            TreeNode* mostleft = _root;
            while(mostleft){
                tree.push(mostleft);
                mostleft = mostleft->left;
            }
        }
    }

    /** @return whether we have a next smallest number */
    bool hasNext() {
        if(tree.empty() && finish)
            return false;
        else
            return true;
    }

    /** @return the next smallest number */
    int next() {
        int visited_value = 0;
        //DFS
        if(!tree.empty() && !finish)
        {
            //visit.
            TreeNode* visited = tree.top();
            visited_value = visited->val;
            tree.pop();
            //insert right sub-tree.
            if(visited->right){
                TreeNode * t = visited->right;
                while(t){
                    tree.push(t);
                    t = t->left;//push most left
                }
            }
            if(tree.empty())
                finish = true;//finished
        }
        return visited_value;
    }
};

/**
 * Your BSTIterator will be called like this:
 * BSTIterator i = BSTIterator(root);
 * while (i.hasNext()) cout << i.next();
 */