{"push_id":833014099,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d584e96c1f9ab96a8619a3c28dc6da5f96b00eb9","before":"e918c61cf9e8e256d67562555e227d70f2a5a6b0","commits":[{"sha":"d584e96c1f9ab96a8619a3c28dc6da5f96b00eb9","author":{"email":"292c5156331e61b0897c4335f53bf81903665170@ucdavis.edu","name":"Zuolin Li  (Mike)"},"message":"Create Binary Tree Maximum Path Sum.java","distinct":true,"url":"https://api.github.com/repos/lzlmike/Lintcode-Java-/commits/d584e96c1f9ab96a8619a3c28dc6da5f96b00eb9"}]}