{"push_id":2067125970,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0edf9b3a51e6b46f26bb9e9ff08843f270c8f4a5","before":"c356d7e33d5213f49a7cbd958879a150f9ac8c1b","commits":[{"sha":"0edf9b3a51e6b46f26bb9e9ff08843f270c8f4a5","author":{"name":"CitizenOfUniverse","email":"facd49e83a94562695bd850fa2835d4fd0840d94@users.noreply.github.com"},"message":"v1.01\n\nAdded tree traverse by right-left-root method.","distinct":true,"url":"https://api.github.com/repos/CitizenOfUniverse/Binary_Search_Tree_Cpp/commits/0edf9b3a51e6b46f26bb9e9ff08843f270c8f4a5"}]}
{"actor":{"display_login":"CitizenOfUniverse"}}