LeetCode 111. Minimum Depth of Binary Tree（二叉树）

111. Minimum Depth of Binary Tree
     Easy

756

412

Favorite

Share
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.

解法1：递归

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int minDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int leftDepth = minDepth(root.left);
        int rightDepth = minDepth(root.right);
        return (leftDepth == 0 || rightDepth == 0) ?Math.max(leftDepth, rightDepth) + 1: Math.min(leftDepth, rightDepth) + 1;
    }
}

解法2：层次遍历（bfs）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    class Node {
        public int depth;
        public TreeNode tnode;
        
        public Node(int depth, TreeNode tnode) {
            this.depth = depth;
            this.tnode = tnode;
        }
    }
    
    public int minDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        LinkedList<Node> q = new LinkedList<Node>();
        q.add(new Node(1, root));
        while (!q.isEmpty()) {
            Node cur = q.poll();
            if (cur.tnode.left == null && cur.tnode.right == null) {
                return cur.depth;
            }
            if (cur.tnode.left != null) {
                q.add(new Node(cur.depth+1, cur.tnode.left));
            }
            if (cur.tnode.right != null) {
                q.add(new Node(cur.depth+1, cur.tnode.right));
            }
        }
        return -1;
    }
}