Binary Search Tree Iterator leetcode

最新推荐文章于 2024-04-09 22:21:57 发布

weixin_33724570

最新推荐文章于 2024-04-09 22:21:57 发布

阅读量47

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/sdlwlxf/p/5167679.html

本文介绍了一种在二叉搜索树(BST)上实现迭代器的方法。该迭代器会在初始化时接收BST的根节点，并能按顺序返回树中下一个最小的数值。文章详细解释了如何使用栈来辅助迭代器的实现，以确保next()和hasNext()方法能在平均O(1)时间内运行。

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class BSTIterator {
private:
    TreeNode *current = NULL; 
    stack<TreeNode*> s;
public:
    BSTIterator(TreeNode *root) {
         // initialize the current pointer
        current = root;
    }

    /** @return whether we have a next smallest number */
    bool hasNext() {
        while(current){
            s.push(current);
            current = current->left;
        }
        return !s.empty();
    }

    /** @return the next smallest number */
    int next() {
        TreeNode* node = s.top();
        s.pop();
        current = node->right;
        return node->val;
    }
};