Easy

45.78%

Given a BST and a value x the task is to delete the nodes having values greater than or equal to x.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. The second line consist of an integer N. Then in the next line are N space separated values of the BST nodes. In the next line is an integer x representing the value of the node in the BST.

**Output:**

For each test case output will be the inorder traversal of the returned root from the function.

**Constraints:**

1<=T<=100

1<=N<=1000

1<=A[]<=1000

1<=x<=N

**Example:
Input:**

2

7

20 8 22 4 12 10 14

8

7

20 8 22 4 12 10 14

10

4

4 8