{"push_id":859378361,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"7f8c3aeb3b6bf3b020872e60d874a39895312d89","before":"b4273c5ec88be8a3137667b4a54678655ba35557","commits":[{"sha":"3298af8bfe739f6386e4839fabfc41d10fb1d859","author":{"email":"703e65b6575ec1dda0850dc4a7a5e0d803d6c7ea@sfu.ca","name":"jhartman"},"message":"Init for BinTree Traversal\n\nInital commit for the work-in-progress of a binary tree traversal in\nlevel order zig-zag pattern","distinct":true,"url":"https://api.github.com/repos/jjhartmann/strident-octo-weasel/commits/3298af8bfe739f6386e4839fabfc41d10fb1d859"},{"sha":"7f8c3aeb3b6bf3b020872e60d874a39895312d89","author":{"email":"703e65b6575ec1dda0850dc4a7a5e0d803d6c7ea@sfu.ca","name":"jhartman"},"message":"Fix solution to the tree traversal problem","distinct":true,"url":"https://api.github.com/repos/jjhartmann/strident-octo-weasel/commits/7f8c3aeb3b6bf3b020872e60d874a39895312d89"}]}