Symmetric Tree with Python

Question: Symmetric Tree

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Approach:

Define a recursive function check_symmetry that takes two nodes as arguments (one from the left subtree and one from the right subtree). Recursively compare corresponding nodes for equality and mirror-like symmetry. If both subtrees are symmetric, and the current nodes have equal values, the tree is symmetric.

Time Complexity: O(n), where n is the number of nodes in the tree

Space Complexity: O(h), where h is the height of the tree

#softwareengineer #dsa #interviewpreparation