{"push_id":1352756523,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3dc52df5f6e4547966c4e5f8e00a5f9939bc0589","before":"8f7d651f34b0b23fcb18eef7ec50ba2ada0ec9b2","commits":[{"sha":"3dc52df5f6e4547966c4e5f8e00a5f9939bc0589","author":{"name":"Renascence","email":"6536012022b971af362e450de0ccab2a06d64e9b@outlook.com"},"message":"Binary Tree Level Order Traversal","distinct":true,"url":"https://api.github.com/repos/Renascence/LeetCode/commits/3dc52df5f6e4547966c4e5f8e00a5f9939bc0589"}]}
{"actor":{"display_login":"Renascence"}}