{"push_id":1413163009,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"53951497c481dd22ccc8320e9eabc2b6a56a3eba","before":"dee10ed0be1c8d7832f62b33b04ce3639bc84805","commits":[{"sha":"53951497c481dd22ccc8320e9eabc2b6a56a3eba","author":{"name":"David Kremer","email":"244dfdfbc87cba279177d14f56dc942ca7c112bc@sewan.fr"},"message":"Clear update of the code. Now we can build a full binary tree and obtain a code list\nfor each letter","distinct":true,"url":"https://api.github.com/repos/elijahbal/huffman-python/commits/53951497c481dd22ccc8320e9eabc2b6a56a3eba"}]}
{"actor":{"display_login":"elijahbal"}}