Leetcode Problem 101. Symmetric Tree

101. Symmetric Tree

Leetcode Solutions

Define a helper function isMirror that takes two nodes, left and right, as arguments.
If both left and right are null, return true (base case for symmetry).
If only one of left or right is null, return false (base case for asymmetry).
If the values of left and right are not equal, return false.
Recursively call isMirror on the left child of left and the right child of right, and on the right child of left and the left child of right.
Return true if both recursive calls return true, otherwise return false.
The main function isSymmetric calls isMirror with the left and right children of the root node.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen