{"push_id":1273391786,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2793a855c2ec8ba0a976bf822ade744b5a963a1c","before":"4289293257d80e41604b4ec55b8c2af4593a1999","commits":[{"sha":"2793a855c2ec8ba0a976bf822ade744b5a963a1c","author":{"name":"ScottShao","email":"db475511b822dda14db577ccdb4d28c0c32fd317@gmail.com"},"message":"[105. Construct Binary Tree from Preorder and Inorder Traversal][Accepted]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/ScottShao/LeetCode-Beats-Over-90-Solution/commits/2793a855c2ec8ba0a976bf822ade744b5a963a1c"}]}
{"actor":{"display_login":"ScottShao"}}