{"push_id":3005744683,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c1c3b8f6209ab5c0ebbd6e3049c53dda6e325ab3","before":"fbe602640269363ae7b22b587083867a6e8125fb","commits":[{"sha":"c1c3b8f6209ab5c0ebbd6e3049c53dda6e325ab3","author":{"name":"Aaron Friedman","email":"8f6ec976869b46686d9f5e8c34f398e0ca058c6b@gmail.com"},"message":"Refactor BinarySearchTree to hide Node implementation details. Add additional functions to Node, BinarySearchTree and Traversal.\n\nNode - add findMaximumDepth and mirror functions to Node.\nBinarySearchTree - add findMinimumValue and printWithinRange.\nTraversal - add isBst.","distinct":true,"url":"https://api.github.com/repos/ajsf/kotlin-ds-algo/commits/c1c3b8f6209ab5c0ebbd6e3049c53dda6e325ab3"}]}
{"actor":{"display_login":"ajsf"}}