tjscanlon

3 ms·

1. 1.▲
   by tjscanlon 11y ago

   Iterative solution: def invertTree(self, root): queue = [] if root is not None: queue.append(root) while queue: current = queue.pop() current.left, current.right = current.ri
2. 2.▲
   by tjscanlon 11y ago

   For everyone who enjoyed this or wants to take it a step further, I recommend writing a CHIP-8 emulator. I used the following source: http://www.multigesture.net/articles/how-to-write-an-emulato... and it was very hel
3. 3.▲
   by tjscanlon 12y ago

   Bravo to the CEO for handling it this way. It really shows how treating others like humans and remaining compassionate no matter what the situation is beneficial to everyone.