Merge pull request #1465 from maradadivyasree020/lc-606-photo

Lc 606 photo

Author: ajay-dhangar

assets/606 ex1.png

@@ -14,15 +14,18 @@ description: "Given the root of a binary tree, construct a string consisting of
 Given the root of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way.
 
 ### 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)"`
 
 **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)"`
@@ -127,4 +130,4 @@ class Solution:
 >Reason: The space complexity is determined by the recursion stack, which in the worst case (unbalanced tree) is O(n), but on average (balanced tree) is O(log n).
 
 ### References
-**LeetCode Problem:** Construct String from Binary Tree
+**LeetCode Problem:** Construct String from Binary Tree