{"push_id":595654105,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b2eaf0c2949e5c6fedec4b227ffe2a38d5cbfbfd","before":"4cfc3a4252c34618be42185462ec1d6b0e68b979","commits":[{"sha":"b2eaf0c2949e5c6fedec4b227ffe2a38d5cbfbfd","author":{"email":"aff466e6eaa1cbaedb07c646524f0b162d037443@gmail.com","name":"Marcus A. Streips"},"message":"level order traversal of binary tree\n\nUsed collections library for double ended queue (deque) functionality.","distinct":true,"url":"https://api.github.com/repos/mastreips/Python-Programs/commits/b2eaf0c2949e5c6fedec4b227ffe2a38d5cbfbfd"}]}