sample output case 1 : 3 case 2 : 1 case 3 : 1 case 4 : 2 case 5 : 6

ow to post a problem c 114 Description In call of duty, the only goal to accomplish is to maximize your enemies taken out and thus have the highest. K/D in the lobby. So now you are playing Call of Duty: World at War (The best call of duty game ever) and you have reached a place with a large staircase in front of you. And there is an enemy at each landing of the staircase (on the left side and the right side of each step 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. Given the following binary search tree 8 10 6 14 4 7 (13 You start with person 8 and you take that person out, and then you move left or right. You want to take out the maximum possible number of enemies. You can take out every person you can see from your position with your suppressed sniper gun. But you can see only the persons at the leftmost standing at each level and cannot see the rest. Before starting shooting them, you want to know how many persons you can take out. You are busy keeping an eye on the enemies. So you want this program to find out the maximum number of people you can take out from that location by providing with the analogous a binary search tree. [ Note: Players do not change their position after one player has been taken out, i.e. the leftinost node remains the same even after player on that node has been taken out. Or we can say that the nodes are not removed after the player on that node has been taken out. ] In other words, you need to find the maximum number of left children on a path of the binary search tree. The input for your program will be an integer (> 0) that denotes the amount of test cases then the numbers to be inserted into a binary search three. The output will be a number that denotes the maximum number of enemies that can be taken out. You will also need to implement a binary search tree type. ow to post a problem c 114 Description In call of duty, the only goal to accomplish is to maximize your enemies taken out and thus have the highest. K/D in the lobby. So now you are playing Call of Duty: World at War (The best call of duty game ever) and you have reached a place with a large staircase in front of you. And there is an enemy at each landing of the staircase (on the left side and the right side of each step 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. Given the following binary search tree 8 10 6 14 4 7 (13 You start with person 8 and you take that person out, and then you move left or right. You want to take out the maximum possible number of enemies. You can take out every person you can see from your position with your suppressed sniper gun. But you can see only the persons at the leftmost standing at each level and cannot see the rest. Before starting shooting them, you want to know how many persons you can take out. You are busy keeping an eye on the enemies. So you want this program to find out the maximum number of people you can take out from that location by providing with the analogous a binary search tree. [ Note: Players do not change their position after one player has been taken out, i.e. the leftinost node remains the same even after player on that node has been taken out. Or we can say that the nodes are not removed after the player on that node has been taken out. ] In other words, you need to find the maximum number of left children on a path of the binary search tree. The input for your program will be an integer (> 0) that denotes the amount of test cases then the numbers to be inserted into a binary search three. The output will be a number that denotes the maximum number of enemies that can be taken out. You will also need to implement a binary search tree type