Update 0606-Construct-String-from-Binary-Tree.md

Author: maradadivyasree020

dsa-solutions/lc-solutions/0600-0699/0606-Construct-String-from-Binary-Tree.md

@@ -16,12 +16,14 @@ Given the root of a binary tree, construct a string consisting of parenthesis an
 ### Examples
 **Example 1:**
 ![Screenshot of the application](.././../../assets/606%20ex1.png)
+
 **Input:** `root = [1,2,3,4]`  
 **Output:** `"1(2(4))(3)"`  
 **Explanation:** Originally, it needs to be `"1(2(4)())(3()())"`, but you need to omit all the unnecessary empty parenthesis pairs. And it will be `"1(2(4))(3)"`
 
-![Screenshot of the application](.././../../assets/606%20ex2.png)
 **Example 2:**
+![Screenshot of the application](.././../../assets/606%20ex2.png)
+
 **Input:** `root = [1,2,3,null,4]`  
 **Output:** `"1(2()(4))(3)"`  
 **Explanation:** Originally, it needs to be `"1(2()(4)())(3()())"`, but you need to omit all the unnecessary empty parenthesis pairs. And it will be `"1(2()(4))(3)"`