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