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

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

---

---

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

---

101. 对称二叉树

• 二叉树

  /**
   * 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 boolean isSymmetric(TreeNode root) {
  
          if (root == null) {
              return true;
          }
  
          return recursion(root.left, root.right);
  
      }
  
      private boolean recursion(TreeNode left, TreeNode right) {
  
          if (left == null && right != null) {
              return false;
          }
  
          if (left != null && right == null) {
              return false;
          }
  
          if (left == null && right == null) {
              return true;
          }
  
          if (left.val != right.val) {
              return false;
          }
  
          return recursion(left.left, right.right) && recursion(left.right, right.left);
  
      }
  }
  

100. 相同的树

• 二叉树

  /**
   * 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 boolean isSameTree(TreeNode p, TreeNode q) {
  
          return recursion(p, q);
  
      }
  
      private boolean recursion(TreeNode left, TreeNode right) {
  
          if (left == null && right != null) {
              return false;
          }
  
          if (left != null && right == null) {
              return false;
          }
  
          if (left == null && right == null) {
              return true;
          }
  
          if (left.val != right.val) {
              return false;
          }
  
          return recursion(left.left, right.left) && recursion(left.right, right.right);
  
      }
  }
  

572. 另一棵树的子树

• 二叉树

  /**
   * 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 boolean isSubtree(TreeNode root, TreeNode subRoot) {
  
          if (root == null) {
              return false;
          }
  
          return recursion(root, subRoot) || isSubtree(root.left, subRoot) || isSubtree(root.right, subRoot);
  
      }
  
      private boolean recursion(TreeNode left, TreeNode right) {
  
          if (left == null && right != null) {
              return false;
          }
  
          if (left != null && right == null) {
              return false;
          }
  
          if (left == null && right == null) {
              return true;
          }
  
          if (left.val != right.val) {
              return false;
          }
  
          return recursion(left.left, right.left) && recursion(left.right, right.right);
  
      }
  }
  

---