IT路上的学步者

/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ public class Solution { publi

题目描述 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. import java.util.*; public cla

题目地址：http://www.nowcoder.com/practice/e9ff41269a7e49519b87fe7d9fd0d477?tpId=49&tqId=29231&rp=1&ru=/ta/2016test&qru=/ta/2016test/question-ranking 题目描述 git是一种分布式代码管理工具，git通过树的形式记录文件的更改历史，比如： base'