{"push_id":2918017031,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e929a9f24c9bbb3c585fdf3c284cb9a2ddeac192","before":"8796d3a5deb20fc217052f4ccc23467745014e49","commits":[{"sha":"e929a9f24c9bbb3c585fdf3c284cb9a2ddeac192","author":{"name":"XiaojieZhuForThree","email":"9c178847b8ba65e9439c23eb43a72eef1927f2e5@users.noreply.github.com"},"message":"Create #889 Construct Binary Tree from Preorder and Postorder Traversal","distinct":true,"url":"https://api.github.com/repos/XiaojieZhuForThree/LeetCodeSolution/commits/e929a9f24c9bbb3c585fdf3c284cb9a2ddeac192"}]}
{"actor":{"display_login":"XiaojieZhuForThree"}}