456789101112131415161718192021222324252627282930313233343536373839404142

# Definition for a binary tree node.
class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.data = val
        self.left = left
        self.right = right

class Solution:
    def is_symmetric(self, root):
        if not root:
            return True # An empty tree is symmetric
        return self.symmetry(root.left, root.right)

    def symmetry(self, left, right):
        if not left and not right:
            return True # Both nodes are null, so symmetric

        if not left or not right:
            return False # One of the nodes is null, so not symmetric

        if left.data != right.data:
            return False # The values of the nodes do not match, so not symmetric

        # Recursively check the children of the nodes
        return self.symmetry(left.left, right.right) and self.symmetry(left.right, right.left)

# Example usage
if __name__ == "__main__":
    solution = Solution()

    # Create a sample tree: 1, 2, 2, 3, 4, 4, 3
    root = TreeNode(1)
    root.left = TreeNode(2)
    root.right = TreeNode(2)
    root.left.left = TreeNode(3)
    root.left.right = TreeNode(4)
    root.right.left = TreeNode(4)
    root.right.right = TreeNode(3)

    # Test the symmetric tree
    print(solution.is_symmetric(root)) # Output: True

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950

// Definition for a binary tree node.
 class TreeNode {
     constructor(val = 0, left = null, right = null) {
         this.data = val;
         this.left = left;
         this.right = right;
     }
 }

class Solution {
    isSymmetric(root) {
        if (!root) {
            return true; // An empty tree is symmetric
        }
        return this.symmetry(root.left, root.right);
    }

    symmetry(left, right) {
        if (!left && !right) {
            return true; // Both nodes are null, so symmetric
        }

        if (!left || !right) {
            return false; // One of the nodes is null, so not symmetric
        }

        if (left.data !== right.data) {
            return false; // The values of the nodes do not match, so not symmetric
        }

        // Recursively check the children of the nodes
        return this.symmetry(left.left, right.right) && this.symmetry(left.right, right.left);
    }
}

// Example usage
const solution = new Solution();

// Create a sample tree: 1, 2, 2, 3, 4, 4, 3
const root = new TreeNode(1);
root.left = new TreeNode(2);
root.right = new TreeNode(2);
root.left.left = new TreeNode(3);
root.left.right = new TreeNode(4);
root.right.left =