二叉树的最小深度

二叉树的最小深度为根节点到最近叶子节点的距离。

样例

给出一棵如下的二叉树:

        1

     /     \ 

   2       3

          /    \

        4      5  

这个二叉树的最小深度为 2

import java.util.LinkedList; import java.util.Queue; /**   * Definition for binary tree   * public class TreeNode {   *     int val;   *     TreeNode left;   *     TreeNode right;   *     TreeNode(int x) { val = x; }   * }   */   /**   * 题目名称：minimum-depth-of-binary-tree   * 题目描述：Given a binary tree, find its minimum depth.   * The minimum depth is the number of nodes along the shortest path   * from the root node down to the nearest leaf node.   */ public class Solution {            /**       * 思路1：       * 深度优先遍历（DFS）       * 如果当前节点是空，则最小深度为 0，返回       * 效率低       */      public int run(TreeNode root) {          if (root ==  null ) {              return 0 ;          }          int l = run(root.left);          int r = run(root.right);          if (l ==  0 || r ==  0 ) {              return l + r +  1 ;          }          return Math.min(l, r) +  1 ;      }            /**       * 思路2：       * 广度优先遍历（BFS）       * 找到第一个叶子结点就可以停止遍历       * 效率高       */      public int run1(TreeNode root) {          if (root ==  null ) {              return 0 ;          }          LinkedList<TreeNode> queue =  new LinkedList<TreeNode>();          LinkedList<TreeNode> layerList =  new LinkedList<TreeNode>();          queue.addFirst(root);          int start =  0 ;          int end =  1 ;          int level =  1 ;          while (!queue.isEmpty()) {              TreeNode temp = queue.removeLast();              start++;              layerList.addFirst(temp);              if (temp.left ==  null && temp.right ==  null ) {                  return level;              }              if (temp.left !=  null ) {                  queue.addFirst(temp.left);              }              if (temp.right !=  null ) {                  queue.addFirst(temp.right);              }              if (start == end) {                  level++;                  start =  0 ;                  end = queue.size();                  layerList =  new LinkedList<TreeNode>();              }          }                    return level;      } 来个非递归的，思路是层序遍历，找到第一个左右结点都为null的情况，就返回 public int run(TreeNode root) {          if (root ==  null )              return 0 ;          if (root.left ==  null && root.right ==  null )              return 1 ;                    int depth =  0 ;          Queue<TreeNode> queue =  new LinkedList<>();          queue.offer(root);          while (!queue.isEmpty()){              int len = queue.size();              depth++;              for ( int i =  0 ; i < len; i++){                  TreeNode cur = queue.poll();                             if (cur.left ==  null && cur.right ==  null )                      return depth;                  if (cur.left !=  null )                      queue.offer(cur.left);                  if (cur.right !=  null )                      queue.offer(cur.right);              }                        }          return 0 ;      } }

添加笔记