{"push_id":866722447,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a4e310ecdc8cf4a86b5a53fefbf9dbadaa698992","before":"6571edfa6f91b03beb8b946c0e00174a921ea54c","commits":[{"sha":"a4e310ecdc8cf4a86b5a53fefbf9dbadaa698992","author":{"email":"d2edb597c82167b8e5c6d67cbe35334f748b4196@gmail.com","name":"Aaron Chung"},"message":"Update Source.cpp\n\nadded a function called lowestCommonAncestor() that takes in 2 values from the BSt and returns their lowest common ancestor","distinct":true,"url":"https://api.github.com/repos/aschung212/BinarySearchTree/commits/a4e310ecdc8cf4a86b5a53fefbf9dbadaa698992"}]}