{"push_id":1449007824,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f08029762efcd96eba6d1a8cd1bc93a7d615031c","before":"b0990103545fa8b487f8c6ebc6c32c6683a78119","commits":[{"sha":"f08029762efcd96eba6d1a8cd1bc93a7d615031c","author":{"name":"Matt Moore","email":"072b67a74babc8fd7fc6533f7fa55d6175291823@carbonhelix.com"},"message":"BinarySearchTree is functional. Add, search, delete work. Checks for duplicate entry before adding.","distinct":true,"url":"https://api.github.com/repos/mattmoore/data_structures/commits/f08029762efcd96eba6d1a8cd1bc93a7d615031c"}]}
{"actor":{"display_login":"mattmoore"}}