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.

非递归解

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution 
{
    public int MinDepth(TreeNode root) 
    {
        if (root == null)
            return 0;
        int n,count=0;
        TreeNode node;
        Queue<TreeNode> q = new Queue<TreeNode>();
        q.Enqueue(root);
        while ((n=q.Count)>0)
        {
            count++;
            for (int i = 0; i < n; i++)
            {
                node = q.Dequeue();
                if (node.left == null && node.right == null)
                    return count;
                if (node.left != null)
                    q.Enqueue(node.left);
                if (node.right != null)
                    q.Enqueue(node.right);
            }
        }
        return count;
    }
}

递归解

public int MinDepth(TreeNode root) 
    {
        if (root == null)
            return 0;
        if (root.left == null)
            return MinDepth(root.right) + 1;
        if (root.right == null)
            return MinDepth(root.left) + 1;
        return Math.Min(MinDepth(root.left), MinDepth(root.right))+1;
    }