对于二叉树是否左右对称,这里考察的主要是一个二叉树的左右子树对应节点的值是否相同。
其实这个思路也很简单,一般可以分为递归的实现和非递归的实现。
我们这里可以构建一棵对称的树,范例代码参考:
package com.mengzhidu.teach.algorithm.tree.demo;
/**
* Created by xinxing on 2019/4/12
*/
public class TreeNodeHelper3 {
public static TreeNode getSymmetric() {
TreeNode aNode = new TreeNode("M", null, null);
TreeNode bNode = new TreeNode("N", aNode, null);
TreeNode cNode = new TreeNode("M", null, null);
TreeNode dNode = new TreeNode("N", null, cNode);
TreeNode root = new TreeNode("O", bNode, dNode);
return root;
}
}
如果求助于递归的实现,则代码比较简单,范例如下:
package com.mengzhidu.teach.algorithm.tree.demo.basic;
import com.mengzhidu.teach.algorithm.tree.demo.TreeNode;
import com.mengzhidu.teach.algorithm.tree.demo.TreeNodeHelper3;
import java.util.Objects;
/**
* 判断一棵二叉树是否是对称的
* 这里我们定义空树是对称的
* 这里是使用递归的方式来实现的
*/
public class SymmetricDemo1 {
public static void main(String[] args) {
TreeNode node = TreeNodeHelper3.getSymmetric();
boolean result = isSymmetric(node.getLeft(), node.getRight());
System.out.println("当前树是否为对称:" + result);
}
private static boolean isSymmetric(TreeNode left, TreeNode right) {
if (left == null && right == null) {
return true;
}
if (left == null || right == null) {
return false;
}
if (!Objects.equals(left.getValue(), right.getValue())) {
return false;
}
return isSymmetric(left.getLeft(), right.getRight()) && isSymmetric(left.getRight(), right.getLeft());
}
}
非递归的话,比较常规的思路是使用栈来实现。
这里我们是同时压入两个节点,然后每次弹出两个节点的形式,代码内容如下:
package com.mengzhidu.teach.algorithm.tree.demo.basic;
import com.mengzhidu.teach.algorithm.tree.demo.TreeNode;
import com.mengzhidu.teach.algorithm.tree.demo.TreeNodeHelper3;
import java.util.Objects;
import java.util.Stack;
/**
* 判断树是否为对称的
* 这里采用了压栈的方式
*/
public class SymmetricDemo2 {
public static void main(String[] args) {
boolean result = true;
TreeNode node = TreeNodeHelper3.getSymmetric();
Stack<TreeNode> stack = new Stack<>();
stack.push(node.getLeft());
stack.push(node.getRight());
while (!stack.isEmpty()) {
TreeNode right = stack.pop();
TreeNode left = stack.pop();
if (right == null && left == null) {
continue;
}
if (right == null || left == null) {
result = false;
break;
}
if (!Objects.equals(right.getValue(), left.getValue())) {
result = false;
break;
}
stack.push(left.getRight());
stack.push(right.getLeft());
stack.push(left.getLeft());
stack.push(right.getRight());
}
System.out.println("是否是对称的:" + result);
}
}
对于判断一棵树是否左右对称,我们就介绍到这里啦。