题目描述(京东面试题,口述如何判断两个树相等)
请实现一个函数,用来判断一棵二叉树是不是对称的。注意,如果一个二叉树同此二叉树的镜像是同样的,定义其为对称的。
与第十八题进行对比,将二叉树转换为镜像二叉树。
方法:递归版
package test;
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
class Solution {
boolean isSymmetrical(TreeNode pRoot){
if(pRoot == null){
return true;
}
return isSame(pRoot.left,pRoot.right);
}
private boolean isSame(TreeNode root1, TreeNode root2){
if(root1 == null && root2 == null){//注意这里不用加left和right了
return true;
}
if(root1 == null || root2 == null){//注意这里不用加left和right了
return false;
}
return root1.val == root2.val &&
isSame(root1.left, root2.right) &&
isSame(root1.right, root2.left);
}
}
public class Main{
public static void main(String[] args) {
TreeNode p1 = new TreeNode(8);
p1.left = new TreeNode(8);
p1.left.left = new TreeNode(9);
p1.left.right = new TreeNode(2);
p1.left.right.left = new TreeNode(4);
p1.left.right.right = new TreeNode(7);
p1.right = new TreeNode(7);
Solution solution = new Solution();
boolean p2 = solution.isSymmetrical(p1);
System.out.println("镜像:"+p2);//8
}
}