{"push_id":581428465,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e4e7e46e40efb4a595396a93608c918b068eeb88","before":"300bda8dd13c05400aa796105155c867195de554","commits":[{"sha":"e4e7e46e40efb4a595396a93608c918b068eeb88","author":{"email":"da9879a3cda8d4a8bd5ddd6b15e6595b22d634ae@gmail.com","name":"QuentinDuval"},"message":"Binary Search Tree\n\nDecoupling the iterator from the BST to adapt it to the Red Black Tree","distinct":true,"url":"https://api.github.com/repos/QuentinDuval/Algorithms/commits/e4e7e46e40efb4a595396a93608c918b068eeb88"}]}