ok
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class BSTIterator {
public:
BSTIterator(TreeNode *root) {
p = root;
}
/** @return whether we have a next smallest number */
bool hasNext() {
if (p == nullptr && st.empty()) return false;
return true;
}
/** @return the next smallest number */
int next() {
while (p != nullptr || !st.empty()) {
if (p != nullptr) {
st.push(p);
p = p->left;
} else {
TreeNode* temp = st.top();
p = temp->right;
st.pop();
return temp->val;
}
}
return -1;
}
private:
stack<TreeNode*> st;
TreeNode* p;
};
/**
* Your BSTIterator will be called like this:
* BSTIterator i = BSTIterator(root);
* while (i.hasNext()) cout << i.next();
*/