Showing:
Handle Score
@Ibrahim Nash 6560
@mb1973 5777
@Quandray 5275
@akhayrutdinov 5111
@saiujwal13083 5074
@kirtidee18 4408
@sanjay05 3762
@mantu_singh 3666
@gfgaccount 3605
@marius_valentin_dragoi 3525
Symmetric Tree
Easy Accuracy: 50.54% Submissions: 50087 Points: 2

Given a Binary Tree. Check whether it is Symmetric or not, i.e. whether the binary tree is a Mirror image of itself or not.

Example 1:

Input:
5
/   \
1     1
/       \
2         2
Output: True
Explanation: Tree is mirror image of
itself i.e. tree is symmetric


Example 2:

Input:
5
/   \
10     10
/  \     \
20  20     30
Output: False

You don't need to read input or print anything. Your task is to complete the function isMirror() which takes the root of the Binary Tree as its input and returns True if the given Binary Tree is a same as the Mirror image of itself. Else, it returns False.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).

Constraints:
0<=Number of nodes<=100

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Symmetric Tree