Binary Search Tree Iterator Using Stack | Using Log(N) Space | Leetcode 173 Solution in Hindi

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. PlayList Link: https://youtube.com/playlist?list=PL-Jc9J83PIiHgjQ9wfJ8w-rXU368xNX4L

Question Name:
Binary Search Tree Iterator using Stack

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.
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.
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: #Tree #BinaryTree #BinarySearchTree #BST #Iterator #BSTItertor

Used #DataStructure: #Stack #LinkedList

#TimeComplexity: O(N)

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

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

Linked Question:

~ No Linked Questions

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

Smimilar Questions:

1. InOrder Morris Traversal In BinaryTree:

a. Pepcoding Portal Link: https://www.pepcoding.com/resources/data-structures-and-algorithms-in-java-levelup/trees/in-order-morris-traversal-in-binarytree/ojquestion

b. Youtube Link:


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

For detailed information and other exercises, VISIT: www.pepcoding.com

Have a look at our result: https://www.pepcoding.com/placements
Follow us on our FB page: https://www.facebook.com/pepcoding
Follow us on Instagram: https://www.instagram.com/pepcoding
Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education


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

#Tree, #BinaryTree, #BinarySearchTree, #BST, #geeksFoeGeeks, #leetcode, #BT, #InOrderMorrisTraversal, #MorrisTraversal #Morris,
#BSTIterator, #BST, #BSTInO1Space, #bstiterator