{"push_id":1076582152,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"25dd46019d38a67239e2099f86a759ad5d180282","before":"5adcdf626227e897a13ac185761f09ca649c7e86","commits":[{"sha":"25dd46019d38a67239e2099f86a759ad5d180282","author":{"email":"c64856b682a78fb299e5d3885fdfdf13074fe43b@qq.com","name":"stephen_w__"},"message":"Construct Binary Tree from Preorder and Inorder Traversal","distinct":true,"url":"https://api.github.com/repos/stephen-w/leetcode/commits/25dd46019d38a67239e2099f86a759ad5d180282"}]}