Return true if a binary tree is a mirror of itself around its center.
Input: one line — the tree in level order.
Output: true or false.
1 2 2 3 4 4 3
true
1 2 2 null 3 null 3
false
Run your code against the sample tests, or Submit to run the full suite.