下面是一个基于Java的解决方案,该解决方案通过递归地比较二叉树的左右子树来判断二叉树是否是对称的:
public class Solution {
public static void main(String[] args) {
int[] tree = {1, 2, 2, 3, 4, 4, 3};
boolean isSymmetric = isSymmetricTree(tree);
System.out.println(isSymmetric ? "YES" : "NO");
}
publ