Update readme.md

Author: javadev

src/main/java/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/readme.md

@@ -31,7 +31,9 @@ Return _the **minimum** score of any possible pair of edge removals on the given
 
 - The 3<sup>rd</sup> component has node [2] with value [5]. Its XOR value is 5 = 5.
 
-The score is the difference between the largest and smallest XOR value which is 10 - 1 = 9. It can be shown that no other pair of removals will obtain a smaller score than 9. 
+The score is the difference between the largest and smallest XOR value which is 10 - 1 = 9.
+
+It can be shown that no other pair of removals will obtain a smaller score than 9. 
 
 **Example 2:**
 
@@ -49,7 +51,9 @@ The score is the difference between the largest and smallest XOR value which is
 
 - The 3<sup>rd</sup> component has nodes [2,5] with values [2,2]. Its XOR value is 2 ^ 2 = 0.
 
-The score is the difference between the largest and smallest XOR value which is 0 - 0 = 0. We cannot obtain a smaller score than 0. 
+The score is the difference between the largest and smallest XOR value which is 0 - 0 = 0.
+
+We cannot obtain a smaller score than 0. 
 
 **Constraints:**