{"push_id":938088942,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b1871d7bb1d99464522bc5a3069752f73b40f9a0","before":"5d0394d7f754ade63319eddd7698b3e83490990c","commits":[{"sha":"b1871d7bb1d99464522bc5a3069752f73b40f9a0","author":{"email":"e33214d09aa2c3a9c7ee82d9d996481a3890ca26@gmail.com","name":"Rohan Singh"},"message":"Binary Search Tree implementation for the Dictionary ADT","distinct":true,"url":"https://api.github.com/repos/rohan-singh/Data-Structures/commits/b1871d7bb1d99464522bc5a3069752f73b40f9a0"}]}