{"push_id":727433280,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"70a5aa2746516f6a02015068b26e1f919e9ae01f","before":"042b18165988f33f5cd20831266c4a78cfdccb2f","commits":[{"sha":"70a5aa2746516f6a02015068b26e1f919e9ae01f","author":{"email":"341dc571d484480752164a106e7507e9b641ffd7@gmail.com","name":"Yan Ma"},"message":"Construct Binary Tree from Inorder and Postorder Traversal #72 ---\nAccepted","distinct":true,"url":"https://api.github.com/repos/mayangithub/LintCode/commits/70a5aa2746516f6a02015068b26e1f919e9ae01f"}]}