{"push_id":1178462916,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"935d821061d3f7d65abde8c0174683e41e607080","before":"9ee4cddf5e51d9c416dbde2b2a23ca37ac2a3303","commits":[{"sha":"935d821061d3f7d65abde8c0174683e41e607080","author":{"name":"Di Wang","email":"fbe0e4924ef9aeba4f924dc114909a5b8928cdac@users.noreply.github.com"},"message":"[105. Construct Binary Tree from Preorder and Inorder Traversal][Accepted]committed by Di","distinct":true,"url":"https://api.github.com/repos/gxwangdi/Leetcode/commits/935d821061d3f7d65abde8c0174683e41e607080"}]}
{"actor":{"display_login":"gxwangdi"}}