{"push_id":642634629,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f161a95dab301f69de9eb6cec9ae97d181f2792f","before":"530fcd7bb18ac7a3980021d43f0a34e5da86284c","commits":[{"sha":"f161a95dab301f69de9eb6cec9ae97d181f2792f","author":{"email":"4b4df3e83fa3e8ead7500da695eb55153db6f140@gmail.com","name":"Louis Jenkins"},"message":"Started pseudo-coding the Linked List's implementations, also added a\nTree enumeration. Thinking of removing the Add callback as it's\ncomplicating things even more, and personally I do not think it is\nneeded. All Add will do is append it to the end for a normal single or\ndouble linked list, yet for a tree I guess I'll have to think of\nsomething. It'll be easier to have the tree already have a specific add\nfunction for MIN/MAX than to have an option to have something like that.\nIt's already getting complicated, I can't even begin to think of what I\nhave to do for an iterator for a tree.","distinct":true,"url":"https://api.github.com/repos/theif519/C_Utils/commits/f161a95dab301f69de9eb6cec9ae97d181f2792f"}]}