Leetcode编程题练习（001）-二叉树的最小深度

1：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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
//2018.10.29 BAT 

//给定二叉树，找到它的最小深度。最小深度是沿从根节点到最近的叶节点的最短路径上的节点数。
public class Solution {
    public int run(TreeNode root) {
        if(root==null){return 0;}
        
        //下面的每个加一表示根节点的个数为一 
        
        if(root.left==null){return run(root.right)+1;}
        if(root.right==null){return run(root.left)+1;}
        
        int leftDepth = run(root.left);
        int rightDepth = run(root.right);
        
        return (leftDepth<rightDepth)?(leftDepth+1):(rightDepth+1);
    }
}