二叉树删除节点时,分为两种情况,删除节点为叶子节点与非叶子节点。
首先判断根节点是否要删除的节点。如果是,则将该二叉树变为空树;否则判断左子节点与右子节点是否要删除的节点。
如果是,删除以该节点为根节点的子树,否则进行递归操作,对左子树与右子树进行操作,查找要删除的节点。
public class Main {
public static void main(String[] args) {
Node node1 = new Node(1, "Amy");
Node node2 = new Node(2, "Bob");
Node node3 = new Node(3, "Candy");
Node node4 = new Node(4, "Doff");
Node node5 = new Node(5, "Emma");
BinaryTree tree = new BinaryTree();
tree.setRoot(node1);
node1.setLeft(node2);
node1.setRight(node3);
node3.setLeft(node5);
node3.setRight(node4);
System.out.println("前序遍历为:");
tree.preOrder();
tree.delNode(3);
System.out.println("删除节点之后,前序遍历为:");
tree.preOrder();
}
}
//节点
class Node {
private int id;
private String name;
Node left;
Node right;
public int getId() {
return id;
}
public Node(int ID, String na) {
this.id = ID;
this.name = na;
}
public void setLeft(Node left) {
this.left = left;
}
public void setRight(Node right) {
this.right = right;
}
@Override
public String toString() {
return "Node{" +
"id=" + id +
", name='" + name + '\'' +
'}';
}
//前序遍历
//根->左->右
public void preOrder() {
System.out.println(this);
if (this.left != null) {
this.left.preOrder();
}
if (this.right != null) {
this.right.preOrder();
}
}
//中序遍历
//左->根->右
public void infixOrder() {
if (this.left != null) {
this.left.infixOrder();
}
System.out.println(this);
if (this.right != null) {
this.right.infixOrder();
}
}
//后序遍历
//左->右->根
public void postOrder() {
if (this.left != null) {
this.left.postOrder();
}
if (this.right != null) {
this.right.postOrder();
}
System.out.println(this);
}
//删除节点
public void delNode(int id) {
//首先判断节点的左子节点与右子节点是否为删除节点
//如果是,则删除以该节点为根的子树;否则递归查找左子树与右子树
if (this.left != null && this.left.id == id) {
this.left = null;
return;
}
if (this.right != null && this.right.id == id) {
this.right = null;
return;
}
if (this.left != null) {
this.left.delNode(id);
}
if (this.right != null) {
this.right.delNode(id);
}
}
}
//二叉树
class BinaryTree {
private Node root;
public void setRoot(Node root) {
this.root = root;
}
//前序遍历
public void preOrder() {
if (this.root != null) {
this.root.preOrder();
} else {
System.out.println("二叉树为空,无法遍历");
}
}
//中序遍历
public void infixOrder() {
if (this.root != null) {
this.root.infixOrder();
} else {
System.out.println("二叉树为空,无法遍历");
}
}
//后序遍历
public void postOrder() {
if (this.root != null) {
this.root.postOrder();
} else {
System.out.println("二叉树为空,无法遍历");
}
}
//删除节点
public void delNode(int id) {
//当二叉树的根节点为要删除的节点时,删除节点之后,二叉树为空
//否则调用删除节点函数
if (this.root != null) {
if (this.root.getId() == id) {
this.root = null;
} else {
this.root.delNode(id);
}
} else {
System.out.println("二叉树为空,无法删除节点");
}
}
}
前序遍历为:
Node{id=1, name='Amy'}
Node{id=2, name='Bob'}
Node{id=3, name='Candy'}
Node{id=5, name='Emma'}
Node{id=4, name='Doff'}
删除节点之后,前序遍历为:
Node{id=1, name='Amy'}
Node{id=2, name='Bob'}