LeetCode 111. Minimum Depth of Binary Tree

分析

难度 易

来源

https://leetcode.com/problems/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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

    3

   / 

  9  20

    /  

   15   7

return its minimum depth = 2.

解答

package LeetCode;

import java.util.LinkedList;
import java.util.Queue;

public class L111_MinimumDepthOfBinaryTree {
    public TreeNode makeBinaryTreeByArray(Integer[] array,int index){
        if(index<array.length&&array[index]!=null){
            int value=array[index];
            TreeNode t=new TreeNode(value);
            array[index]=0;
            t.left=makeBinaryTreeByArray(array,index*2+1);
            t.right=makeBinaryTreeByArray(array,index*2+2);
            return t;
        }else
            return null;
    }
    public int minDepth(TreeNode root) {
        if(root==null)
            return 0;
        int left=minDepth(root.left);
        int right=minDepth(root.right);
        if(left==0||right==0)
            //一个子树高度为零，当前节点非叶子节点，高度为非空子树的高度+1;
            // 两个子树高度都为0，当前节点为叶子节点，高度为1
            return Math.max(left,right)+1;
        else
            return Math.min(left,right)+1;
    }
    public void levelOrderTraversal(TreeNode root){//广度优先搜索+分层.注意非全二叉树插入空节点
        if(root==null)
            return;
        Queue<TreeNode> queue=new LinkedList<TreeNode>();
        queue.offer(root);
        int curCount=1;//记录当前层节点数
        int nextCount=0;//记录下一层节点数
        int outCount=0;//记录出队列节点数
        while(!queue.isEmpty()){
            TreeNode node=queue.poll();
            outCount++;
            if(node!=null){
                System.out.print(node.val);//空节点无值打印，直接输出下方的tab
                queue.offer(node.left);
                nextCount++;
                queue.offer(node.right);
                nextCount++;
            }
            System.out.print("	");
            if(outCount==curCount)//当前层全部出队列
            {
                System.out.println();
                curCount=nextCount;
                nextCount=0;
                outCount=0;
            }
        }
    }
    public static void main(String[] args){
        L111_MinimumDepthOfBinaryTree l111=new L111_MinimumDepthOfBinaryTree();
        Integer[] nums={3,9,20,null,null,15,7};
        //Integer[] nums={1,2,2,3,3,null,null,4,4};
        TreeNode root=l111.makeBinaryTreeByArray(nums,0);
        l111.levelOrderTraversal(root);
        System.out.println(l111.minDepth(root));
    }
}