{"push_id":1186750843,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"554995dde22e7d6a0fbdec09e87290112994cc6c","before":"b030b6f90edbe854f64a09197a4f0803cb128c32","commits":[{"sha":"554995dde22e7d6a0fbdec09e87290112994cc6c","author":{"name":"xh286","email":"9dd76594c6e121855daac7cb04591fb60e980c79@nyu.edu"},"message":"[105. Construct Binary Tree from Preorder and Inorder Traversal][Compile Error]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/xh286/leetcode/commits/554995dde22e7d6a0fbdec09e87290112994cc6c"}]}
{"actor":{"display_login":"xh286"}}