{"push_id":2949332055,"size":1,"distinct_size":1,"ref":"refs/heads/trees","head":"79aae14d7fffcefa5cdbc892056bdb5c2247b9ec","before":"8b23c4df5a7a317d31a0e5bf884da07b8b7b501e","commits":[{"sha":"79aae14d7fffcefa5cdbc892056bdb5c2247b9ec","author":{"name":"Brian Vann","email":"5164e5013c369e3791735d6bec599369828850e8@gmail.com"},"message":"Reduce binary search tree clutter, rely on recursive solutions, 80 line binary tree sounds great","distinct":true,"url":"https://api.github.com/repos/taylor-vann/data-structures-and-algorithms/commits/79aae14d7fffcefa5cdbc892056bdb5c2247b9ec"}]}
{"actor":{"display_login":"taylor-vann"}}