Binary Search Tree Iterator 2

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):

2. BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root 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() Returns true if there exists a number in the traversal to the right of the pointer, otherwise returns false.
int next() Moves the pointer to the right, then returns the number at the pointer.

3. 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.
Input Format
Input is managed for you.
Output Format
Output is managed for you. 
Question Video
Constraints
1. The number of nodes in the tree is in the range [1, 105].
2. 0 <= Node.val <= 106
3. At most 105 calls will be made to hasNext, and next.
Sample Input
7
1 2 3 4 5 6 7
Sample Output
1
2
3
4
5
6
7


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name