{"push_id":761427055,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2546df1433e79f5fc60df742e2d238e1d7b485b3","before":"0013af0eddf390c2d6140f1f6895718a0f5a3597","commits":[{"sha":"2546df1433e79f5fc60df742e2d238e1d7b485b3","author":{"email":"0850c3d1829ec3a3c96b3d38a63273d73c4c77e3@gmail.com","name":"answerrrrrrrrr"},"message":"111.Easy.Minimum_Depth_of_Binary_Tree.py\n\nhttps://leetcode.com/discuss/41766/3-lines-in-every-language","distinct":true,"url":"https://api.github.com/repos/answerrrrrrrrr/leetcode/commits/2546df1433e79f5fc60df742e2d238e1d7b485b3"}]}