<h2><a href="https://www.geeksforgeeks.org/problems/symmetric-tree/1">Symmetric Tree</a></h2><h3>Difficulty Level : Easy</h3><hr><div class="problems_problem_content__Xm_eO"><p><span style="font-size: 18px;">Given a Binary Tree. Check whether it&nbsp;is&nbsp;Symmetric&nbsp;or not, i.e. whether the binary tree is a&nbsp;<strong>Mirror image of itself</strong> or not.</span></p>
<p><span style="font-size: 18px;"><strong>Example 1:</strong></span></p>
<pre><span style="font-size: 18px;"><strong>Input:
</strong>         5
       /   \
      1     1
     /       \
    2         2<strong>
Output: <br></strong>True<strong>
Explanation: <br></strong>Tree is mirror image of itself i.e. tree is symmetric</span>
</pre>
<p><span style="font-size: 18px;"><strong>Example 2:</strong></span></p>
<pre><span style="font-size: 18px;"><strong>Input:
</strong>         5
       /   \
      10     10
     /  \     \
    20  20     30<strong>
Output: <br></strong>False</span></pre>
<p><span style="font-size: 18px;"><strong>Your Task:</strong><br>You don't need to read input or print anything. Your task is to complete the function&nbsp;<strong>isSymmetric()</strong>&nbsp;which takes the root of the Binary Tree as its input and returns True if the given Binary Tree is the same as the Mirror image of itself. Else, it returns False.</span></p>
<p><span style="font-size: 18px;"><strong>Expected Time Complexity:</strong>&nbsp;O(N).<br><strong>Expected Auxiliary Space:</strong>&nbsp;O(Height of the Tree).</span></p>
<p><span style="font-size: 18px;"><strong>Constraints:</strong><br>0&lt;=N&lt;=10<sup>5</sup></span></p></div><p><span style=font-size:18px><strong>Company Tags : </strong><br><code>Amazon</code>&nbsp;<code>Microsoft</code>&nbsp;<br><p><span style=font-size:18px><strong>Topic Tags : </strong><br><code>Tree</code>&nbsp;<code>Data Structures</code>&nbsp;