0173. Binary Search Tree Iterator
https://leetcode.com/problems/binary-search-tree-iterator
Description
Implement the BSTIterator
class that represents an iterator over the in-order traversal of a binary search tree (BST):
BSTIterator(TreeNode root)
Initializes an object of theBSTIterator
class. Theroot
of the BST is given as part of the constructor. The pointer should be initialized to a non-existent number smaller than any element in the BST.boolean hasNext()
Returnstrue
if there exists a number in the traversal to the right of the pointer, otherwise returnsfalse
.int next()
Moves the pointer to the right, then returns the number at the pointer.
Notice that by initializing the pointer to a non-existent smallest number, the first call to next()
will return the smallest element in the BST.
You may assume that next()
calls will always be valid. That is, there will be at least a next number in the in-order traversal when next()
is called.
Example 1:
Constraints:
The number of nodes in the tree is in the range
[1, 105]
.0 <= Node.val <= 106
At most
105
calls will be made tohasNext
, andnext
.
Follow up:
Could you implement
next()
andhasNext()
to run in averageO(1)
time and useO(h)
memory, whereh
is the height of the tree?
ac1, slow and exceed memory requirement
ac2:
The key is how to reduce the memory. if you use list to get them all, it's way lager than O(h). so this solution get them dynamically, only get when you need.
Last updated