{"push_id":1175568276,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1ce0748107595858eb7436b80d5d92c32bea2b32","before":"f6f8970e56c6a8207595cf71429d81f386f0578f","commits":[{"sha":"1ce0748107595858eb7436b80d5d92c32bea2b32","author":{"name":"Di Wang","email":"fbe0e4924ef9aeba4f924dc114909a5b8928cdac@users.noreply.github.com"},"message":"[145. Binary Tree Postorder Traversal][Accepted]committed by Di","distinct":true,"url":"https://api.github.com/repos/gxwangdi/Leetcode/commits/1ce0748107595858eb7436b80d5d92c32bea2b32"}]}
{"actor":{"display_login":"gxwangdi"}}