《LeetCode力扣练习》代码随想录——二叉树（合并二叉树---Java）

《LeetCode力扣练习》代码随想录——二叉树（合并二叉树—Java）

---

---

刷题思路来源于 代码随想录

---

617. 合并二叉树

• 二叉树-前序遍历

  /**
   * Definition for a binary tree node.
   * public class TreeNode {
   * int val;
   * TreeNode left;
   * TreeNode right;
   * TreeNode() {}
   * TreeNode(int val) { this.val = val; }
   * TreeNode(int val, TreeNode left, TreeNode right) {
   * this.val = val;
   * this.left = left;
   * this.right = right;
   * }
   * }
   */
  class Solution {
      public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
  
          return recursion(root1, root2);
  
      }
  
      private TreeNode recursion(TreeNode t1, TreeNode t2) {
  
          if (t1 == null) {
              return t2;
          }
  
          if (t2 == null) {
              return t1;
          }
  
          t1.val = t1.val + t2.val;
          t1.left = recursion(t1.left, t2.left);
          t1.right = recursion(t1.right, t2.right);
  
          return t1;
  
      }
  }
  1
  2
  3
  4
  5
  6
  7
  8
  9
  10
  11
  12
  13
  14
  15
  16
  17
  18
  19
  20
  21
  22
  23
  24
  25
  26
  27
  28
  29
  30
  31
  32
  33
  34
  35
  36
  37
  38
  39
  40

---