本文共 1112 字，大约阅读时间需要 3 分钟。

/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class BSTIterator {
   public:    BSTIterator(TreeNode* root) {
           cur=root;    }        /** @return the next smallest number */    int next() {
           while(cur){
               s.push(cur);            cur=cur->left;        }        cur=s.top();        s.pop();        int val=cur->val;        cur=cur->right;        return val;    }        /** @return whether we have a next smallest number */    bool hasNext() {
           if(cur||!s.empty())            return 1;        return 0;    }private:    stack
   
     s;    TreeNode *cur;};/** * Your BSTIterator object will be instantiated and called as such: * BSTIterator* obj = new BSTIterator(root); * int param_1 = obj->next(); * bool param_2 = obj->hasNext(); */
   

转载地址：https://blog.csdn.net/xiji333/article/details/107942494 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！