{"push_id":631698195,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4d9e797628fb462cee850511074d925d0f6cf380","before":"54c88c3968dbbbdac2d4fce23981ec66c1b0f2fa","commits":[{"sha":"4d9e797628fb462cee850511074d925d0f6cf380","author":{"email":"4497f720a700496fcb277310c31c5c6ef9d4b930@gmail.com","name":"be1009"},"message":"leetcode tree Construct Binary Tree from Preorder and Inorder Traversal","distinct":true,"url":"https://api.github.com/repos/ben1009/Algorithm/commits/4d9e797628fb462cee850511074d925d0f6cf380"}]}