leetcode——树-2021-02-05

最新推荐文章于 2024-04-17 20:16:10 发布

涛&宇

最新推荐文章于 2024-04-17 20:16:10 发布

阅读量57

点赞数

分类专栏：学习笔记文章标签：二叉树 leetcode 算法 clojure 队列

本文链接：https://blog.csdn.net/weixin_43111836/article/details/113687559

版权

学习笔记专栏收录该内容

27 篇文章 0 订阅

订阅专栏

题目100.相同的树

前序遍历两棵树，比较对应节点值是否完全相等

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




# 题目101.对称二叉树



```java
 * 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 check(root.left,root.right);
    }
    private boolean check(TreeNode p,TreeNode q){
        if(p==null&q==null){
            return true;
        }else if (p==null||q==null){
            return false;
        }else{
            return p.val==q.val&&check(p.left,q.right)&&check(p.right,q.left);
        }
    }
}

题目104.二叉树的最大深度

- ```java
  /**
   * 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 int maxDepth(TreeNode root) {
          if (root == null) {
              return 0;
          } else {
              int leftHeight = maxDepth(root.left);
              int rightHeight = maxDepth(root.right);
              return Math.max(leftHeight, rightHeight) + 1;
          }
      }
  }




# 题目107.二叉树的层序遍历





```java
class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
      List<List<Integer>> levelOrder = new LinkedList<List<Integer>>();
        if (root == null) {
            return levelOrder;
        }
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            List<Integer> level = new ArrayList<Integer>();
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                level.add(node.val);
                TreeNode left = node.left, right = node.right;
                if (left != null) {
                    queue.offer(left);
                }
                if (right != null) {
                    queue.offer(right);
                }
            }
            levelOrder.add(0, level);
        }
        return levelOrder;
    }
}