{"push_id":797967454,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"44b090326031268353a66e3c6d13263edcfbe5a6","before":"807e7dbf60407517289506d035e645348b8b674c","commits":[{"sha":"44b090326031268353a66e3c6d13263edcfbe5a6","author":{"email":"5aaf7a5b67daa30f837cf6fb56bcad51c8df3f77@nyu.edu","name":"jl5311"},"message":"Minimum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/jliunyu/LeetcodeGitHub/commits/44b090326031268353a66e3c6d13263edcfbe5a6"}]}