{"push_id":3028776630,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d4108f692e7f8af1d20e633f2a29ce42a698dadc","before":"19fe034856b1d1c4c84338110259503ea4d03349","commits":[{"sha":"d4108f692e7f8af1d20e633f2a29ce42a698dadc","author":{"name":"Adarsh S","email":"bd9067de14008d84c430081bdd7e1351ffab58d0@gmail.com"},"message":"Binary search tree are that which all the elements in the left tree are smaller\nthan the one in the right subtree.\nMy first implementation just checked the three simultaneous nodes and\nnot the elements on a subtree.\n\nA brute force implementation would just store all the values in an\narray by doing inorder traversal and checking if the elements in the\narray are stored in ascending order","distinct":true,"url":"https://api.github.com/repos/isht3/Top-Secret-Private-Project/commits/d4108f692e7f8af1d20e633f2a29ce42a698dadc"}]}
{"actor":{"display_login":"isht3"}}