Coding SOlution of symmetric tree

sushant097 · sushant097 · commit 58ee41f1bd2a · 2022-07-16T22:02:43.000+05:45
diff --git a/coding_solutions/DataStructure_related/Tree/CheckSymmetryTree.py b/coding_solutions/DataStructure_related/Tree/CheckSymmetryTree.py
@@ -1,9 +1,17 @@
+'''
+    Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
+
+
+'''
+
+
 # Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, val=0, left=None, right=None):
 #         self.val = val
 #         self.left = left
 #         self.right = right
+
 class Solution:
     def isSymmetric(self, root: Optional[TreeNode]) -> bool:
         def isMirror(root1, root2):
