{"push_id":672615570,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"70d1fe168daebf30c7d95af05d20362a6e0a7bbf","before":"b8fa741781a174df9067e9fc7ec90cb9d5633deb","commits":[{"sha":"70d1fe168daebf30c7d95af05d20362a6e0a7bbf","author":{"email":"c2298a9c8ff0df428c0d0100b0b4203e114d5f5b@gmail.com","name":"everbird"},"message":"Minimum Depth of Binary Tree solved","distinct":true,"url":"https://api.github.com/repos/everbird/leetcode-py/commits/70d1fe168daebf30c7d95af05d20362a6e0a7bbf"}]}