# Next Node on Its Right - Google Top Interview Questions

### Problem Statement :

```You are given a binary tree root containing unique values, and an integer target.

Find the node with value target and return the node that's directly right of it on its level.

If the target node doesn't exist or if it's already in the rightmost position, return null.

Constraints

0 ≤ n ≤ 100,000 where n is the number of nodes in root

Example 1

Input

Visualize

tree = [1, [2, [4, null, null], [5, null, null]], [3, null, [6, [7, null, null], null]]]

target = 5

Output

[6, [7, null, null], null]

Example 2

Input

tree = [1, [2, null, null], [3, null, null]]

target = 3

Output

null

Explanation

There's no node directly to the right of 3.

Example 3

Input

tree = [1, null, null]

target = 2

Output

null

Explanation

Node 2 doesn't exist.```

### Solution :

```                        ```Solution in C++ :

Tree* solve(Tree* tree, int target) {
if (not tree) {
return nullptr;
}
queue<Tree*> q;
q.push(tree);
Tree* cur;
while (not q.empty()) {
int s = q.size();
while (s--) {
cur = q.front();
q.pop();

if (cur->val == target) {
if (s >= 1) {
Tree* now = q.front();
q.pop();
return now;
}
}

if (cur->left) {
q.push(cur->left);
}
if (cur->right) {
q.push(cur->right);
}
}
}
return nullptr;
}```
```

```                        ```Solution in Java :

import java.util.*;

/**
* public class Tree {
*   int val;
*   Tree left;
*   Tree right;
* }
*/
class Solution {
public Tree solve(Tree tree, int target) {
q.offer(tree);
boolean trigger = false;
while (!q.isEmpty()) {
int size = q.size();
for (int x = 0; x < size; x++) {
Tree temp = q.poll();
if (trigger) {
return temp;
}
if (temp.val == target) {
trigger = true;
}

if (temp.left != null)
q.offer(temp.left);
if (temp.right != null)
q.offer(temp.right);
}
if (trigger)
return null;
}
return null;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, tree, target):
q = deque()
q.append(tree)
while q:
isInLevel = len(q)
while isInLevel:
temp = q.popleft()
if temp.val == target:
if isInLevel > 1:
return q.popleft()
else:
return None
if temp.left:
q.append(temp.left)
if temp.right:
q.append(temp.right)
isInLevel -= 1

return None```
```

## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

## Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

## Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty