{"push_id":677085075,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"cbb89b5bfc68851b49d38179fe8dfa54efaeb676","before":"801004a41f0896a5ed05995d6383c791ac8f8fb7","commits":[{"sha":"cbb89b5bfc68851b49d38179fe8dfa54efaeb676","author":{"email":"e6f0071a8f653d5188a9e2e83fe8cdb113703ec7@126.com","name":"bluesilence"},"message":"Update construct-binary-tree-from-preorder-and-inorder-traversal.cpp\n\nSecond time.\r\nNote: How to calculate preBegin for the right child: L45.","distinct":true,"url":"https://api.github.com/repos/bluesilence/cpp/commits/cbb89b5bfc68851b49d38179fe8dfa54efaeb676"}]}