**Binary Search Tree Iterator Sequel - Facebook Top Interview Questions**

### Problem Statement :

Implement a binary search tree iterator with the following methods: next returns the next smallest element in the tree hasnext returns whether there is a next element in the iterator prev returns the next bigger element in the tree hasprev returns whether there is a previous element in the iterator For example, given the following tree root 4 / \ 2 7 / 5 Then we have it = BSTIterator(root) it.next() == 2 it.next() == 4 it.hasnext() == True it.next() == 5 it.next() == 7 it.hasnext() == False it.hasprev() == True it.prev() == 5 Example 1 Input methods = ["constructor", "hasnext", "hasnext", "hasprev", "hasprev", "next", "hasnext", "hasnext", "hasprev"] arguments = [[[0, null, [2, [1, null, null], null]]], [], [], [], [], [], [], [], []]` Output [None, True, True, False, False, 0, True, True, False]

### Solution :

` ````
Solution in C++ :
class BSTIterator { // Time: O(1) amortized, in worst case O(H), Space: O(N)
private:
stack<Tree*> next_stack;
vector<int> history;
int index;
public:
BSTIterator(Tree* root) {
index = -1;
while (root) {
next_stack.push(root);
root = root->left;
}
}
int next() {
if (index + 1 < history.size()) {
index++; // Move to next element in history and return it
return history[index];
}
Tree* next_node = next_stack.top();
next_stack.pop();
int value = next_node->val;
next_node = next_node->right;
while (next_node) {
next_stack.push(next_node);
next_node = next_node->left;
}
index++;
history.push_back(value);
return value;
}
bool hasnext() {
return !next_stack.empty();
}
int prev() {
// Move to previous element in history and return it
index--;
return history[index];
}
bool hasprev() {
return index > 0;
}
};
```

` ````
Solution in Python :
class BSTIterator:
def __init__(self, root):
self.nodes, self.cur = [], -1
# get nodes
def dfs(root):
if root: # inorder -----Left Root Right----
dfs(root.left), self.nodes.append(root.val), dfs(root.right)
dfs(root)
self.size = len(self.nodes)
def next(self):
self.cur += 1
return self.nodes[self.cur] if self.cur < self.size else None
def hasnext(self):
return self.cur < self.size - 1
def prev(self):
self.cur -= 1
return self.nodes[self.cur] if self.cur >= 0 else None
def hasprev(self):
return self.cur > 0
```

## View More Similar Problems

## Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →## Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →## The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →## Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →## Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →## Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T

View Solution →