{"push_id":959131165,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c4d4c4fbbc6a2c4d991ac1ac12d9fd14bece0465","before":"aa462154c8bf7173eb1724fc0db8be128e32c1cf","commits":[{"sha":"c4d4c4fbbc6a2c4d991ac1ac12d9fd14bece0465","author":{"email":"9ac7b8a99342b049b4c19d597fb85c1e3ea2bfd7@gmail.com","name":"Jie Zhou"},"message":"Construct Binary Tree from Preorder and Inorder Traversal","distinct":true,"url":"https://api.github.com/repos/jeffjiezhou/Leetcode_Java/commits/c4d4c4fbbc6a2c4d991ac1ac12d9fd14bece0465"}]}