{"push_id":1419325422,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"ad978e102504a17743a8c65306b8eedb8b09af1b","before":"b2f2228876ff2138a6d1d0b7a8612909be480ba2","commits":[{"sha":"d14f1276adedf54075ce85b9f5cc048f0abdb3f1","author":{"name":"Jesse Lloyd","email":"96b68112d53fb5801eb95dd1ffa80ad10abf07a1@students.fhu.edu"},"message":"Add binary search tree, with accompanying test.","distinct":true,"url":"https://api.github.com/repos/jesselloyd/technical-interview-prep/commits/d14f1276adedf54075ce85b9f5cc048f0abdb3f1"},{"sha":"ea05d7e3e5538c3916638d64d8bbb2cacf8e250c","author":{"name":"Jesse Lloyd","email":"96b68112d53fb5801eb95dd1ffa80ad10abf07a1@students.fhu.edu"},"message":"Add height method for binary search tree, improved tests and fixed a logic error in insert method that was causing tree to fill in only on the left side. (typo here, wrote left instead of right in all cases. Now fixed). Also added isLeaf method to Node for slightly better code clarity.","distinct":true,"url":"https://api.github.com/repos/jesselloyd/technical-interview-prep/commits/ea05d7e3e5538c3916638d64d8bbb2cacf8e250c"},{"sha":"ad978e102504a17743a8c65306b8eedb8b09af1b","author":{"name":"Jesse Lloyd","email":"96b68112d53fb5801eb95dd1ffa80ad10abf07a1@students.fhu.edu"},"message":"Merge README into local code.","distinct":true,"url":"https://api.github.com/repos/jesselloyd/technical-interview-prep/commits/ad978e102504a17743a8c65306b8eedb8b09af1b"}]}
{"actor":{"display_login":"jesselloyd"}}