{"push_id":833165255,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"812e7c905e9eee8a70b956f4bcf4fa949df81049","before":"c54d4f332b739113f07be1fa9ded814d82cf806b","commits":[{"sha":"812e7c905e9eee8a70b956f4bcf4fa949df81049","author":{"email":"a09155d94fede94db3a9da52e8a08b984f4f5c3f@163.com","name":"pacosonTang"},"message":"implementation of building binary tree and inordering its nodes","distinct":true,"url":"https://api.github.com/repos/pacosonTang/dataStructure-algorithmAnalysis/commits/812e7c905e9eee8a70b956f4bcf4fa949df81049"}]}