Java for Leetcode 101 symmetric Tree

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

For example, this binary tree is symmetric:

    1   /   2   2/\/3  4 4  3

But the following are not:

    1   /   2   2   \      3    3

Problem Solving Ideas:

Overload a issymmetric to determine whether two trees are symmetrical, Java implementations are as follows:

    public Boolean issymmetric (TreeNode root) {    if (root==null)    return true;    Return Issymmetric (root.left,root.right);    } public boolean issymmetric (TreeNode Left,treenode right) {if (left==null| | Right==null) return left==null&&right==null;if (Left.val!=right.val) return False;return (IsSymmetric ( Left.left,right.right) &&issymmetric (Left.right,right.left));}

Java for Leetcode 101 symmetric Tree