{"push_id":822475457,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"78ba00d2dd6fc3de69875d4f29bfe62288bb6716","before":"fe9d82a0ab6389de555d66e0f887e2bd248eb322","commits":[{"sha":"78ba00d2dd6fc3de69875d4f29bfe62288bb6716","author":{"email":"da016a23af7ce342b03a910a8e9a320a30b6f1ed@126.com","name":"zhaoyuned"},"message":"Update Tree/Construct Binary Tree from Inorder and Postorder Traversal .md","distinct":true,"url":"https://api.github.com/repos/zhaoyunED/leetBook/commits/78ba00d2dd6fc3de69875d4f29bfe62288bb6716"}]}