bm32

在这里插入代码片

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public boolean Compare(TreeNode root1,TreeNode root2){
        if(root1==null&&root2==null){return true;}
      if(root1==null||root2==null||root1.val!=root2.val){
          return false;
      }  
      return Compare(root1.left,root2.right)&&Compare(root1.right,root2.left);
    }
    boolean isSymmetrical(TreeNode pRoot) {
        return Compare(pRoot,pRoot);
    }
}

在这里插入代码片

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param t1 TreeNode类 
     * @param t2 TreeNode类 
     * @return TreeNode类
     */
    public TreeNode mergeTrees (TreeNode t1, TreeNode t2) {
        // write code here
    
   if(t1==null){return t2;}
   if(t2==null){return t1;}
   TreeNode head=new TreeNode(t1.val+t2.val);
   head.left=mergeTrees(t1.left,t2.left);
   head.right=mergeTrees(t1.right,t2.right);
   return head; }
}

已知两颗二叉树，将它们合并成一颗二叉树。