{"push_id":831010093,"size":1,"distinct_size":1,"ref":"refs/heads/patch-1","head":"31890c63f03756f112d4ad9b9ed918b968622c95","before":"74b4f400922f614a43d4f8cf577d228897236eeb","commits":[{"sha":"31890c63f03756f112d4ad9b9ed918b968622c95","author":{"email":"4c92f670848bdabf15314fe411ef331fe0ea3aef@gmail.com","name":"David Runger"},"message":"invert-tree: Add test cases for asymmetric trees\n\nMy first attempt at this challenge takes a tree like this:\r\n\r\n```\r\n    A\r\n   /\r\n  B\r\n```\r\n\r\nand makes it into a tree like this:\r\n\r\n```\r\n    A\r\n   / \\\r\n  B   B\r\n```\r\n\r\nwhen it should produce a tree like this:\r\n\r\n```\r\n    A\r\n     \\\r\n      B\r\n```\r\n\r\nHowever, my flawed solution was passing the single test example that\r\ncurrently exists for this challenge. I have added two test examples, one\r\nfor a left-leaning asymmetric tree and one for a right-leaning\r\nasymmetric tree. These examples catch the type of flaw discussed above,\r\nand should be helpful in encouraging/forcing challengers to clean up\r\nafter old child nodes.","distinct":true,"url":"https://api.github.com/repos/davidrunger/exercises/commits/31890c63f03756f112d4ad9b9ed918b968622c95"}]}