leetcode 101. 对称二叉树

 1 class Solution {
 2     public boolean isSymmetric(TreeNode root) {
 3         return searchSym(root,root);
 4     }
 5     public boolean searchSym(TreeNode left,TreeNode right){
 6         if(left==null&&right==null){
 7             return true;
 8         }else if(left!=null&&right!=null){
 9              if((left.val==right.val)?true:false){
10                  return searchSym(left.left,right.right)&&searchSym(left.right,right.left);
11              }else{
12                  return false;
13              }
14         }else{
15             return false;
16         }
17     }
18 }