{"push_id":1238534773,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9d02fe5eea9f5eb3ef2bb2d15396f149f5eba85f","before":"dbd4274cb6190f26fa83e95f29d80460435649c0","commits":[{"sha":"9d02fe5eea9f5eb3ef2bb2d15396f149f5eba85f","author":{"name":"wyuanchen","email":"66fb187c716fd3b9727cae55ded219865a9a8394@gmail.com"},"message":"Construct Binary Tree from Inorder and Postorder Traversal","distinct":true,"url":"https://api.github.com/repos/wyuanchen/leetCode/commits/9d02fe5eea9f5eb3ef2bb2d15396f149f5eba85f"}]}
{"actor":{"display_login":"wyuanchen"}}