public boolean isSymmetric(TreeNode root) {
if (root == null) {
return true;
}
return isSym(root.left, root.right);
}
private boolean isSym(TreeNode leftNode, TreeNode rightNode) {
if (leftNode == null && rightNode == null) {
return true;
}
if (leftNode == null || rightNode == null || leftNode.val != rightNode.val) {
return false;
}
return isSym(leftNode.left, rightNode.right) && isSym(leftNode.right, rightNode.left);
}
LeetCode-Algorithms-[Easy][树]面试题28. 对称的二叉树
猜你喜欢
转载自blog.csdn.net/m0_37302219/article/details/105550745
今日推荐
周排行