{"repository":{"has_wiki":true,"description":"Leftrb is a Left-Leaning Red-Black (LLRB) implementation of 2–3 balanced binary search trees in Python. Port of the code presented by Robert Sedgewick in his paper.","owner":"peterhil","pushed_at":"2013-01-21T18:55:07-08:00","watchers":0,"forks":0,"has_issues":true,"stargazers":0,"fork":false,"size":116,"has_downloads":true,"created_at":"2013-01-21T18:54:26-08:00","private":false,"open_issues":0},"actor_attributes":{"name":"Peter Hillerström","blog":"http://composed.nu/peterhil","company":"","location":"Helsinki, Finland","type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/peterhil/leftrb/compare/master"}