{"push_id":2848719026,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0fad570cd9f0c4c90edb4aee20ab45d4c4632c27","before":"8c2e5bb56304f4af4de7731463311cc311f76032","commits":[{"sha":"0fad570cd9f0c4c90edb4aee20ab45d4c4632c27","author":{"name":"Dendi","email":"1ce1416347075b6070a35ce5e9d26b61d91ea6c3@DendideMacBook-Pro.local"},"message":"construct binary tree from inorder ans postorder tranveral","distinct":true,"url":"https://api.github.com/repos/Dendiom/LeetCode/commits/0fad570cd9f0c4c90edb4aee20ab45d4c4632c27"}]}
{"actor":{"display_login":"Dendiom"}}