{"repository":{"description":"Note: Personal project I coded to learn how to traverse binary trees.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":124,"owner":"aqibmushtaq","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Java","created_at":"2013-12-05T16:12:41-08:00","pushed_at":"2013-12-05T17:38:35-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Aqib Mushtaq","blog":"www.aqibmushtaq.co.uk","location":"United Kingdom","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/aqibmushtaq/evaluate-infix/compare/96c0eecf36...fdcc77915f"}