{"push_id":1848115102,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f013faf240b3ea4bc16b6572a2c6c4435ca7d9fd","before":"f5f983ca20ab41c6ddb2e98b4090cc83d9a0378e","commits":[{"sha":"f013faf240b3ea4bc16b6572a2c6c4435ca7d9fd","author":{"name":"HIMABI","email":"c184b4a4db13e59e2437e33b90765f3982c9ce50@naver.com"},"message":"Create 03 - Tree: Inorder Traversal.cpp","distinct":true,"url":"https://api.github.com/repos/goodann/AlgorithmsStudy/commits/f013faf240b3ea4bc16b6572a2c6c4435ca7d9fd"}]}
{"actor":{"display_login":"SJH90"}}