{"push_id":730511880,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"949dbf8ada5424b5fae4e4fe405689128b2119c9","before":"e26a6fe0c2c269709f304da6d6d2ed8b1dc70b8d","commits":[{"sha":"949dbf8ada5424b5fae4e4fe405689128b2119c9","author":{"email":"32784473fc8ccfd7ed28db978ed797e914f6a527@outlook.com","name":"puritys"},"message":"To solve minDepthBinaryTree","distinct":true,"url":"https://api.github.com/repos/puritys/leetcode/commits/949dbf8ada5424b5fae4e4fe405689128b2119c9"}]}