isSymmetric = function(root) {
    return dfs(root.left, root.right);
}
DFS | Tree-trevarsal
Time O(n) | Space O(n)
https://leetcode.com/problems/symmetric-tree/
@param {TreeNode} root
@return {boolean}