{"push_id":1230236936,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"faea8fc83cbef2a96a07ee0f5aa05170d1870e12","before":"c6db73432d467a33c55bedb574b8f68562a49cea","commits":[{"sha":"faea8fc83cbef2a96a07ee0f5aa05170d1870e12","author":{"name":"Zhenchao Gan","email":"bba145aee9fea6d585c38baa5ce473c8e31db2d8@qq.com"},"message":"145. Binary Tree Postorder Traversal","distinct":true,"url":"https://api.github.com/repos/gzc/leetcode/commits/faea8fc83cbef2a96a07ee0f5aa05170d1870e12"}]}
{"actor":{"display_login":"gzc"}}