Total allowed time: 1 hour

Interpersonal:

1. Tell me about yourself and what you currently do.
2. Interesting projects

1st part: Implement a TreeNode

2nd part: Invert Binary Tree https://leetcode.com/problems/invert-binary-tree/

3rd part: Print out the binary tree from part 2 by level.

e.g. if the output from part 2 looks like this:

	4
   /   \
  7     2
 / \   / \
9   6 3   1

Print out:
4
7 2
9 6 3 1

IMPORTANT NOTE: YOUR CODE MUST COMPILE PERFECTLY

Result: Rejected.
I finished the interview feeling confident because I did everything correct with optimal space/time complexity. However, I still got rejected. I suspect it might be because the third part took me a few extra attempts to get it right.