{"push_id":734830077,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"087602ad392fef8e0905df87f0685965ceec85a6","before":"9081bcb27ead057f7f83992538498dc564d7b6d0","commits":[{"sha":"087602ad392fef8e0905df87f0685965ceec85a6","author":{"email":"04b21aa058ecc30a7ee24c686756e3fd1736b813@buaa.edu.cn","name":"zhuwr"},"message":"前序遍历和中序遍历树构造二叉树","distinct":true,"url":"https://api.github.com/repos/zhuwr/LintCode/commits/087602ad392fef8e0905df87f0685965ceec85a6"}]}