leetcode-173 Binary Search Tree Iterator

最新推荐文章于 2024-09-25 16:05:14 发布

sole_cc

最新推荐文章于 2024-09-25 16:05:14 发布

阅读量387

点赞数

文章标签： leetcode C++

本文链接：https://blog.csdn.net/sole_cc/article/details/44960795

版权

leetcode解题报告专栏收录该内容

96 篇文章 0 订阅

订阅专栏

主要思想就是中序遍历

<span style="font-family:Microsoft YaHei;font-size:14px;">/**
 * 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) {
       pushAll(root);
    }

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

    /** @return the next smallest number */
    int next() {
        TreeNode *tmp = st.top();
        st.pop();
        pushAll(tmp->right);
        return tmp->val;
    }
    
    void pushAll(TreeNode *node){
        while(node != NULL ){
            st.push(node);
            node = node->left;
        }
    }
private:
    stack<TreeNode *> st;
};

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