Language C++: Kill Monger Suppose you are playing a killing game and have to kill few of your enemies. You are at a cliff and from there you can see few of them. You see the enemies at your height only. Therefore, you can only kill at the same height. The enemies are forming a balanced binary tree where their General is at the top of the other cliff, his two commanders are on the first level below him. The soldiers are at the lowest level. Total four soldiers are appointed. Under both the commanders exact two soldiers serve. You have to make a strategy to kill the left commander first, than whoever takes his position kill him. Now start killing the right side with same strategy until only one enemy is left at left side. Now increase your height and kill the General. You can only win if only three of your enemies are left. Display the enemies who are left and who have been killed. Don’t forget to print your victory message. HINT: Balancing is the key to achieve your goal.
Language C++:
Kill Monger
Suppose you are playing a killing game and have to kill few of your enemies. You are at a
cliff and from there you can see few of them. You see the enemies at your height only.
Therefore, you can only kill at the same height. The enemies are forming a balanced binary
tree where their General is at the top of the other cliff, his two commanders are on the first
level below him. The soldiers are at the lowest level. Total four soldiers are appointed. Under
both the commanders exact two soldiers serve.
You have to make a strategy to kill the left commander first, than whoever takes his position
kill him. Now start killing the right side with same strategy until only one enemy is left at left
side. Now increase your height and kill the General. You can only win if only three of your
enemies are left.
Display the enemies who are left and who have been killed. Don’t forget to print your victory
message.
HINT: Balancing is the key to achieve your goal.
Step by step
Solved in 4 steps with 3 images
