{"push_id":2741789885,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"8404c35d23c5ee05a4ad207f343c8519985fcdf2","before":"4317efe4d199294b6248c9f20daa21fdfe96e0c9","commits":[{"sha":"b1bc5ad700fbc643a39a8ed6661e379880a067f9","author":{"name":"clinyong","email":"68c897658c21a6bc35d11bed3f288e8c85e8bc02@gmail.com"},"message":"Check sequence of BST","distinct":true,"url":"https://api.github.com/repos/clinyong/computer-science-in-js/commits/b1bc5ad700fbc643a39a8ed6661e379880a067f9"},{"sha":"8404c35d23c5ee05a4ad207f343c8519985fcdf2","author":{"name":"clinyong","email":"68c897658c21a6bc35d11bed3f288e8c85e8bc02@gmail.com"},"message":"Find tree path according to the sum","distinct":true,"url":"https://api.github.com/repos/clinyong/computer-science-in-js/commits/8404c35d23c5ee05a4ad207f343c8519985fcdf2"}]}
{"actor":{"display_login":"clinyong"}}