Binary Search Tree Iterator 2 | Module : Trees | In English | Java | Video_29

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this question we print numbers in Increasing Order and Decreasing Order.

Question Name:
Binary Search Tree Iterator 2

Question Link:

Question Statement:
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.

Topic: #Binary Search Tree Iterator 2 #trees #binary Tree

#TimeComplexity: O(N)

#SpaceComplexity: O(Log(N)), worst case : O(N)

--------------------------------------------------------------

More Youtube PlayList:


---------------------------------------------------------------

Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.



We also provide professional courses with live classes and placement opportunities.

.

.

.

Happy Programming !!! Pep it up

----------------------------------------------------------------