JAVA ||Easy Recursive solution || Easiest Approach || Runtime: 0 ms
\nclass Solution {\n    public boolean isSymmetric(TreeNode root) {\n       return root == null || isMirror(root.left, root.right);\n    }\n    boolean isMirror
```\nclass Solution {\n    public boolean isSymmetric(TreeNode root) {\n       return root == null || isMirror(root.left, root.right);\n    }\n    boolean isMirror(TreeNode node1, TreeNode node2) {\n        if (node1 == null && node2 == null) return true;\n        \n        if (node1 == null || node2 == null) return false;\n        \n        if (node1.val != node2.val) return false;\n        return isMirror(node1.left, node2.right) && isMirror(node1.right, node2.left);\n    }\n}\n\n```\n![image](https://assets.leetcode.com/users/images/0ad972be-ccb4-4c1f-92f1-2ec39d38b178_1665474715.5691338.png)\n
['Depth-First Search', 'Binary Tree', 'Java']