Symmetric Tree Check

Function Name: isSymmetricTree

Description

Write a function that takes the root node of a binary tree as its parameter and returns a boolean indicating whether the tree is symmetric around its center. A binary tree is considered symmetric if it can be divided into two halves that are mirror images of each other.

The function should handle trees with any number of nodes, and nodes may have the value of any integer.

A tree with zero nodes (empty tree) should be considered symmetric.

Requirements

• The function must be named isSymmetricTree.
• The function should take a single parameter, which represents the root node of a binary tree.
• The function must return a boolean value.
• Do not use any external libraries or packages.
• Consider the tree data structure and how nodes are represented in code.
• If necessary, you can define auxiliary functions to help in your implementation.

Examples

Given a binary tree represented as:    1   / \  2   2 / \ / \3  4 4  3The isSymmetricTree function should return true since it's symmetric.If the tree is adjusted as follows:    1   / \  2   2   \   \   3    3The isSymmetricTree function should return false because it's not symmetric.

Links