A binary tree is symmetric if the right subtree of the root node is the mirror reflection of its left subtree.
Given a binary tree, you are asked to check if it’s symmetric.
The input contains space-separated integers representing the values in the nodes of the binary tree. The order of the values is given by traversing from the left to the right subtree every time. A value of 0 means that the node does not exist. It’s guaranteed that the input binary tree is valid.
The program should print Yes if the given binary tree is symmetric, and No otherwise.