Symmetric Tree Problem


Description

LeetCode Problem 101.

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Example 1:

1
2
Input: root = [1,2,2,3,4,4,3]
Output: true

Example 2:

1
2
Input: root = [1,2,2,null,3,null,3]
Output: false

Constraints:

  • The number of nodes in the tree is in the range [1, 1000].
  • -100 <= Node.val <= 100


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
    bool isMirror(TreeNode* t1, TreeNode* t2) {
        if ((t1 == NULL) && (t2 == NULL))
            return true;
        else if (t1 == NULL)
            return false;
        else if (t2 == NULL)
            return false;
        else
            return (
                (t1->val == t2->val) && 
                isMirror(t1->left, t2->right) && 
                isMirror(t1->right, t2->left)
            );
    }
    
    bool isSymmetric(TreeNode* root) {
        return isMirror(root, root);
    }
};




Related Posts

Vertical Order Traversal Of A Binary Tree Problem

LeetCode 987. Given the root of a binary tree, calculate...

Univalued Binary Tree Problem

LeetCode 965. A binary tree is uni-valued if every node...

Sum Of Distances In Tree Problem

LeetCode 834. There is an undirected connected tree with n...

Smallest Subtree With All The Deepest Nodes Problem

LeetCode 865. Given the root of a binary tree, the...

Smallest String Starting From Leaf Problem

LeetCode 988. You are given the root of a binary...

Similar String Groups Problem

LeetCode 839. Two strings Xand Yare similar if we can...