Concise Recursive Java Solution
This method is my best recursive try. Use two TreeNode as parameters.\n\nIf you are willing to help, \n\nPlease go to https://oj.leetcode.com/discuss/24968/is-m
This method is my best recursive try. Use two TreeNode as parameters.\n\nIf you are willing to help, \n\nPlease go to https://oj.leetcode.com/discuss/24968/is-my-method-a-recursive-one-java-solution\nto see my another recursive solution and give some comment on that recursive method.\n   \n\n    public class Solution {\n            public boolean isSymmetric(TreeNode root) {\n                if(root==null){return true;}\n                return isSymmetric(root.left, root.right);\n            }\n            \n            private boolean isSymmetric(TreeNode a, TreeNode b){\n                if(a==null&&b==null){return true;}\n                if(a==null||b==null){return false;}\n                if(a.val!=b.val){return false;}\n                return isSymmetric(a.left,b.right)&&isSymmetric(a.right,b.left);\n            }\n        }
['Recursion', 'Java']