码迷,mamicode.com
首页 > 其他好文 > 详细

[leetode]Binary Search Tree Iterator

时间:2014-12-31 23:59:57      阅读:412      评论:0      收藏:0      [点我收藏+]

标签:

用个stack模拟递归即可

 

/**
 * 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) {
        while(root) {
            st.push(root);
            root = root->left;
        }
    }

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

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

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

 

[leetode]Binary Search Tree Iterator

标签:

原文地址:http://www.cnblogs.com/x1957/p/4196731.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!