image.png
思路：递归，左子树和右子树是否相等
public boolean isSymmetric(TreeNode root) {
return isMirror(root, root);
}
public boolean isMirror(TreeNode t1, TreeNode t2) {
if (t1 == null && t2 == null) {
return true;
}
if (t1 == null || t2 == null) {
return false;
}
if (t1.val == t2.val) {
return isMirror(t1.left, t2.right) && isMirror(t1.right, t2.left);
}
return false;
}
101. Symmetric Tree Description Given a binary tree, chec...
101. Symmetric Tree Given a binary tree, check whether it...
树的代码 101. Symmetric Tree Given a binary tree, check wheth...
101. Symmetric Tree 题目: https://leetcode.com/problems/sym...
100. Same Tree 判断两棵树是否相同 递归版本 非递归版本 101. Symmetric Tree ...
分类：Tree/BackTracking 时间复杂度: O(n) 这种把树的节点都遍历一遍的情况时间复杂度为O(n...
题目分析 Given a binary tree, check whether it is a mirror of...
https://leetcode.com/problems/symmetric-tree/description/...
Problem Given a binary tree, check whether it is a mirror...
判断二叉树是否对称 同时遍历左子树和右子树,判断是否对称
本文标题：101. Symmetric Tree
本文链接：https://www.haomeiwen.com/subject/sesduqtx.html
网友评论