LeetCode 173. Binary Search Tree Iterator

描述

找BST树下一个节点值

解决

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) {
        func(root);   
    }

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

   /** @return the next smallest number */
    int next() {
        //cout << st.size() << endl;
        TreeNode* zz = st.top();
        st.pop();
       // TreeNode* parent = st.top();
        func(zz -> right);
        return zz -> val;
    }
    void func(TreeNode *tmp){
        while (tmp)
        {
        //  cout << tmp -> val << endl;
            st.push(tmp);
            tmp = tmp -> left;
        }
    }
    stack<TreeNode*> st;
};

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