{"push_id":1254409028,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"38bc4c0d7101efeb0a43b7b76aa19a93c55c2a40","before":"2a987696719cd30b58f135b4536f3182629823bf","commits":[{"sha":"38bc4c0d7101efeb0a43b7b76aa19a93c55c2a40","author":{"name":"Burlesque","email":"280cbf95afe8fdb7d670ef8f773137ba5f7cc206@nyu.edu"},"message":"Update 111. Minimum Depth of Binary Tree.cpp","distinct":true,"url":"https://api.github.com/repos/Burlesque1/LeetCode-II/commits/38bc4c0d7101efeb0a43b7b76aa19a93c55c2a40"}]}
{"actor":{"display_login":"Burlesque1"}}