{"push_id":1375049579,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"96fe735eac63e573c76cea1ca58ff07263806624","before":"359890918d427e27a1aa60a28ed9200fec60b4d2","commits":[{"sha":"96fe735eac63e573c76cea1ca58ff07263806624","author":{"name":"Igor","email":"fea8b8a55140f5cd0f13fbe1125383c11e52a6fc@gmail.com"},"message":"Solve Problem 104 - Maximum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/igorsubbotin/leetcode_python/commits/96fe735eac63e573c76cea1ca58ff07263806624"}]}
{"actor":{"display_login":"igorsubbotin"}}