Scribd can represent a topic hierarchy as a binary tree for a programming exercise. Write a function that determines whether the tree is symmetric around its center, meaning the left and right subtrees are mirror images.
Implement is_symmetric(root), where root is either None or a nested dictionary with this structure:
value: an integer node valueleft: another node dictionary or Noneright: another node dictionary or NoneReturn True if the tree is symmetric and False otherwise. Two corresponding nodes must have equal values, and their children must appear in mirrored positions. An empty tree is symmetric.
def is_symmetric(root):