LeetCode(173) Binary Tree Iterator

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.

//104ms
/**
* Definition for binary tree
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/

class BSTIterator {
private:
std::stack<TreeNode*> stack;
public:
BSTIterator(TreeNode *root) {
while (root != NULL) {
stack.push(root);
root = root->left;
}
}

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

/** @return the next smallest number */
int next() {
TreeNode* current = stack.top();
TreeNode* return_current = current;
stack.pop();
current = current->right;
while(current != NULL) {
stack.push(current);
current = current->left;
}
return return_current->val;
}
};

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

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120