{"push_id":1344205727,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a189c4ec8863a5978f3aac0ad700873979756ef2","before":"a550906503a8eb5f4dface7c2bc09b8a07d467c8","commits":[{"sha":"a189c4ec8863a5978f3aac0ad700873979756ef2","author":{"name":"xiiixuan","email":"e8e570d2d7271081f784ac2eaa021750c770d75d@gmail.com"},"message":"Create 144. Binary Tree Preorder Traversal","distinct":true,"url":"https://api.github.com/repos/xiiixuan/LeetCode-practice/commits/a189c4ec8863a5978f3aac0ad700873979756ef2"}]}
{"actor":{"display_login":"xiiixuan"}}