note: Use binary search tree & C++ language to implement the program.
Yatin is playing PUBG and he has reached a place with a large staircase in front of him. And there is an enemy at each landing of the staircase.The staircase is analogous to a binary tree with each of its nodes as a landing of the staircase and each of its edges as stairs from one landing to another.
Yatin wants to kill the maximum possible number of enemies. He can kill every person he can see from his position with his suppressed sniper gun. But he can see only the persons at the leftmost standing at each level and cannot see the rest.
Before starting shooting them, he wants to know how many persons he can kill. He is busy keeping an eye on the enemies. So he wants you to find out the maximum number of people he can kill from that location by providing you with the analogous a binary search tree.
[ Note: Players do not change their position after one player has died, i.e. the leftmost node remains the same even after player on that node has died. Or we can say that the nodes are not removed after the player on that node has died. ]
Input
The first line of input contains a number t denoting the number of test cases.
The first line of each test case contains n, the number of nodes in the tree.
The second line of each test case contains n space separated integers (unique) ai denoting the value at each node of the BST.
Output
Print the answer for each test case on a new line.
Constraints
1 <= t <= 20
1 <= n <= 1000
1 <= ai <= 1000000000
note: Use binary search tree & C++ language to implement the program.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
