要求
1)如果删除的节点是叶子节点,则删除该节点;
2)如果删除的节点是非叶子节点,则删除该子树;
3)测试完,删除掉8号叶子节点和3号子树
删除思路分析
代码实现
package com.atschool.tree;
public class BinaryTreeDemo {
public static void main(String[] args) {
//先需要创建一个二叉树
BinaryTree binaryTree = new BinaryTree();
//创建需要的节点
HeroNode root = new HeroNode(1, "宋江");
HeroNode node2 = new HeroNode(2, "吴用");
HeroNode node3 = new HeroNode(3, "卢俊义");
HeroNode node4 = new HeroNode(4, "公孙胜");
HeroNode node5 = new HeroNode(5, "武松");
HeroNode node6 = new HeroNode(6, "林冲");
HeroNode node7 = new HeroNode(7, "鲁智深");
HeroNode node8 = new HeroNode(8, "李逵");
HeroNode node9 = new HeroNode(9, "关胜");
//先手动创建二叉树
binaryTree.setRoot(root);
root.setLeft(node2);
root.setRight(node3);
node2.setLeft(node4);
node2.setRight(node5);
node3.setLeft(node6);
node3.setRight(node7);
node4.setRight(node8);
node7.setLeft(node9);
//测试
/* System.out.println("前序遍历");
binaryTree.preOrder();*/
/*
System.out.println("中序遍历");
binaryTree.infixOrder();*/
/* System.out.println("后序遍历");
binaryTree.postOrder();*/
/* //前序查找
System.out.println("中序查找方式~~~~~~~~~~");
HeroNode resNode = binaryTree.infixOrderSearch(5);
if(resNode != null){
System.out.printf("找到了,信息为no=%d name=%s",resNode.getNo(),resNode.getName());
} else{
System.out.printf("没有找打no =%d 的英雄",5);
}*/
System.out.println("删除前,前序遍历");
binaryTree.preOrder();
binaryTree.delNode(8);
binaryTree.delNode(7);
System.out.println("删除后,前序遍历");
binaryTree.preOrder();
}
}
class BinaryTree{
private HeroNode root;
public void setRoot(HeroNode 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 HeroNode preOrderSearch(int no){
if(this.root != null){
return this.root.preOrderSearch(no);
} else {
return null;
}
}
//中序查找
public HeroNode infixOrderSearch(int no){
if(this.root != null){
return this.root.infixOrderSearch(no);
} else {
return null;
}
}
//后序查找
public HeroNode postOrderSearch(int no){
if(this.root != null){
return this.root.postOrderSearch(no);
} else {
return null;
}
}
//删除节点
public void delNode(int no){
if(root != null){
if(root.getNo() == no){
root =null;
} else{//递归删除
root.delNode(no);
}
} else{
System.out.println("空树,不能删除~~~~");
}
}
}
class HeroNode{
private int no;
private String name;
private HeroNode left;//默认为null
private HeroNode right;//默认为null
public HeroNode(int no, String name) {
this.no = no;
this.name = name;
}
public int getNo() {
return no;
}
public void setNo(int no) {
this.no = no;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public HeroNode getLeft() {
return left;
}
public void setLeft(HeroNode left) {
this.left = left;
}
public HeroNode getRight() {
return right;
}
public void setRight(HeroNode right) {
this.right = right;
}
@Override
public String toString() {
return "HeroNode{" +
"no=" + no +
", 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 HeroNode preOrderSearch(int no){
System.out.println("进入前序查找");
//比较当前节点是不是
if(this.no == no){
return this;
}
//如果左递归前序查找,找到节点,则返回
HeroNode resNode = null;
if(this.left != null){
resNode =this.left.preOrderSearch(no);
}
if(resNode != null){//说明在左子树找到
return resNode;
}
//如果右递归前序查找,找到节点,则返回
if(this.right != null){
resNode =this.right.preOrderSearch(no);
}
return resNode;
}
//中序遍历查找
public HeroNode infixOrderSearch(int no){
//如果左递归前序查找,找到节点,则返回
HeroNode resNode = null;
if(this.left != null){
resNode =this.left.infixOrderSearch(no);
}
if(resNode != null){//说明在左子树找到
return resNode;
}
System.out.println("进入中序查找");
//比较当前节点是不是
if(this.no == no){
return this;
}
//如果右递归前序查找,找到节点,则返回
if(this.right != null){
resNode =this.right.infixOrderSearch(no);
}
return resNode;
}
//后序遍历查找
public HeroNode postOrderSearch(int no){
//如果左递归前序查找,找到节点,则返回
HeroNode resNode = null;
if(this.left != null){
resNode =this.left.postOrderSearch(no);
}
if(resNode != null){//说明在左子树找到
return resNode;
}
//如果右递归前序查找,找到节点,则返回
if(this.right != null){
resNode =this.right.postOrderSearch(no);
}
if(resNode != null){//说明在左子树找到
return resNode;
}
System.out.println("进入后序查找");
//比较当前节点是不是
if(this.no == no){
return this;
}
return resNode;
}
//递归删除节点
public void delNode(int no){
//思路:1.因为我们的二叉树是单向的,所以我们是判断当前节点的子节点是否删除,而不是去判断这个节点是不是小删除的节点
//2.如果当前节点的左子节点不为空,并且左子节点就是要删除的节点,就将this.left =null;并且就返回(结束递归删除)
//3.如果当前节点的右子节点不为空,并且右子节点就是要删除的节点,就将this.right =null;并且就返回(结束递归删除)
//4.如果第2和第3步没有删除节点,那么我们就需要向左子树进行递归删除
//5.如果第4步也没有删除节点,则应当向右子树进行递归删除
if(this.left != null && this.left.getNo() == no ){
this.left = null;
return;
}
if(this.right != null && this.right.getNo() == no ){
this.right = null;
return;
}
if(this.left != null){
this.left.delNode(no);
}
if(this.right != null){
this.right.delNode(no);
}
}
}