{"push_id":555034005,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"938d78a83e3d6cbbce98293369efc92f7d9014f2","before":"2ede97f7cd36128b7a14aa27821e09c711f29237","commits":[{"sha":"938d78a83e3d6cbbce98293369efc92f7d9014f2","author":{"email":"d382162f17df53a7160523a88bcf65b6e48f7901@gmail.com","name":"huangruiyun"},"message":"Create Construct Binary Tree from Inorder and Postorder Traversal","distinct":true,"url":"https://api.github.com/repos/huangruiyun/leetcode/commits/938d78a83e3d6cbbce98293369efc92f7d9014f2"}]}