1、二叉树的概念和常用术语
1.1、树的示意图
1.2、二叉树的概念
2、前序中序后序遍历二叉树
2.1、思路分析
2.2、代码实现1
package tree;
public class BinaryTreeDemo
{
public static void main(String[] args)
{
}
}
//定义的BinaryTree二叉树
class BinaryTree
{
private HeroNode root;
public void setRoot(HeroNode node)
{
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("二叉树为空,无法遍历");
}
}
}
//先创建HeroNode结点
class HeroNode
{
private int no;
private String name;
private HeroNode left; //默认为null
private HeroNode right;
public HeroNode(int no, String name)
{
this.name = name;
this.no = no;
}
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;
}
/* (non-Javadoc)
* @see java.lang.Object#toString()
*/
@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); //先输出父节点
}
}
2.3、代码实现2+测试
package 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, "林冲");
//先手动创建二叉树,后序会有递归创建
root.setLeft(node2);
root.setRight(node3);
node3.setRight(node4);
binaryTree.setRoot(root);
//前序
System.out.println("前序遍历:");
binaryTree.preOrder();
//中序
System.out.println("中序遍历:");
binaryTree.infixOrder();
//后序
System.out.println("后序遍历:");
binaryTree.PostOrder();
}
}
//定义的BinaryTree二叉树
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("二叉树为空,无法遍历");
}
}
}
//先创建HeroNode结点
class HeroNode
{
private int no;
private String name;
private HeroNode left; //默认为null
private HeroNode right;
public HeroNode(int no, String name)
{
this.name = name;
this.no = no;
}
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;
}
/* (non-Javadoc)
* @see java.lang.Object#toString()
*/
@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); //先输出父节点
}
}
3、前序 中序 后序查找
3.1、思路分析
3.2、代码实现
package 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, "关胜");
//先手动创建二叉树,后序会有递归创建
root.setLeft(node2);
root.setRight(node3);
node3.setRight(node4);
node3.setLeft(node5);
binaryTree.setRoot(root);
//前序
System.out.println("前序遍历:");
binaryTree.preOrder();
//中序
System.out.println("中序遍历:");
binaryTree.infixOrder();
//后序
System.out.println("后序遍历:");
binaryTree.PostOrder();
//前序遍历查找
System.out.println("前序遍历查找~~");
HeroNode resNode = binaryTree.preOrderSearch(5);
if(resNode != null)
{
System.out.printf("找到了,信息为 no=%d name=%s\n", resNode.getNo(), resNode.getName());
}else
{
System.out.printf("没有找到no=%d的英雄\n", 5);
}
//中序遍历查找
System.out.println("中序遍历查找~~");
HeroNode resNode2 = binaryTree.infixOrderSearch(3);
if(resNode2 != null)
{
System.out.printf("找到了,信息为 no=%d name=%s\n", resNode2.getNo(), resNode2.getName());
}else
{
System.out.printf("没有找到no=%d的英雄\n", 3);
}
//后序遍历查找
System.out.println("后序遍历查找~~");
HeroNode resNode3 = binaryTree.postOrderSearch(2);
if(resNode3 != null)
{
System.out.printf("找到了,信息为 no=%d name=%s\n", resNode3.getNo(), resNode3.getName());
}else
{
System.out.printf("没有找到no=%d的英雄\n", 2);
}
}
}
//定义的BinaryTree二叉树
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(root != null)
{
return root.preOrdersearch(no);
}else {
return null;
}
}
//中序遍历查找
public HeroNode infixOrderSearch(int no)
{
if(root != null)
{
System.out.println(no+ "***");
return root.infixOrderSearch(no);
}else {
return null;
}
}
//后序遍历查找
public HeroNode postOrderSearch(int no)
{
if(root != null)
{
return root.postOrderSearch(no);
}
else {
return null;
}
}
}
//先创建HeroNode结点
class HeroNode
{
private int no;
private String name;
private HeroNode left; //默认为null
private HeroNode right;
public HeroNode(int no, String name)
{
this.name = name;
this.no = no;
}
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 + "]";
}
//前序遍历的方法
//比较4次
public void preOrder()
{
System.out.println(this); //先输出父节点
//递归左子树前序遍历
if(this.left != null)
{
this.left.preOrder();
}
//递归右子树前序遍历
if(this.right != null)
{
this.right.preOrder();
}
}
//中序遍历的方法
//比较3次
public void infixOrder()
{
//递归左子树前序遍历
if(this.left != null)
{
this.left.infixOrder();
}
System.out.println(this); //先输出父节点
//递归右子树前序遍历
if(this.right != null)
{
this.right.infixOrder();
}
}
//后序遍历的方法
//比较2次
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("进入前序遍历 : " + this.no);
//比较当前节点是不是
if(this.no == no)
{
return this;
}
//1、则判断当前节点的左子节点是否为空,如果不为空。则递归前序查找
//2、如果左递归前序查找,找到节点,则返回
HeroNode resNode = null;
if(this.left != null)
{
resNode = this.left.preOrdersearch(no);
}
if(resNode != null) //说明我们左子树找到
{
return resNode;
}
//1、右递归前序查找,找到结点,则返回,否则继续判断
//2、当前的结点的右节点是否为空,如果不为空,则继续向右递归前序查找
if(this.right != null)
{
resNode = this.right.preOrdersearch(no);
}
return resNode; //返回结果
}
//中序遍历查找
public HeroNode infixOrderSearch(int no)
{
//1、则判断当前节点的左子节点是否为空,如果不为空。则递归中序查找
HeroNode resNode = null;
if(this.left != null)
{
resNode = this.left.infixOrderSearch(no);
}
if(resNode != null) //说明我们左子树找到
{
return resNode;
}
//比较当前节点是不是
if(this.no == no)
{
return this;
}
//1、右递归中序查找,找到结点,则返回,否则继续判断
//2、当前的结点的右节点是否为空,如果不为空,则继续向右递归中序查找
if(this.right != null)
{
resNode = this.right.infixOrderSearch(no);
}
return resNode; //返回结果
}
//后序查找
public HeroNode postOrderSearch(int no)
{
//1、则判断当前节点的左子节点是否为空,如果不为空。则递归后序查找
HeroNode resNode = null;
if(this.left != null)
{
resNode = this.left.postOrderSearch(no);
}
if(resNode != null) //说明我们左子树找到
{
return resNode;
}
//1、右递归后序查找,找到结点,则返回,否则继续判断
//2、当前的结点的右节点是否为空,如果不为空,则继续向右递归后序查找
if(this.right != null)
{
resNode = this.right.postOrderSearch(no);
}
if(resNode != null) //说明我们左子树找到
{
return resNode;
}
//如果左右节点都没找到
//返回当前节点
if(this.no == no)
{
return this;
}
return resNode;
}
}
4、二叉树删除节点
4.1、思路
4.2、代码实现
package 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, "关胜");
//先手动创建二叉树,后序会有递归创建
root.setLeft(node2);
root.setRight(node3);
node3.setRight(node4);
node3.setLeft(node5);
binaryTree.setRoot(root);
//测试删除结点
System.out.println("删除前:前序遍历");
binaryTree.preOrder(); //1.2.3.5.4
System.out.println("删除后:后序遍历");
binaryTree.delNode(3);
binaryTree.preOrder(); //1.2.3.4
}
}
//定义的BinaryTree二叉树
class BinaryTree
{
private HeroNode root;
public void setRoot(HeroNode root)
{
this.root = root;
}
//删除结点
public void delNode(int no)
{
if(root != null)
{
//如果只有一个root结点,这里立即判断root是不是就是要删除的结点
if(root.getNo() == no)
{
root = null;
}else {
//递归删除
root.delNode(no);
}
}else {
System.out.println("空树,不能删除~");
}
}
//前序遍历
public void preOrder()
{
if(this.root != null)
{
this.root.preOrder();
}
else {
System.out.println("二叉树为空,无法遍历");
}
}
}
//先创建HeroNode结点
class HeroNode
{
private int no;
private String name;
private HeroNode left; //默认为null
private HeroNode right;
public HeroNode(int no, String name)
{
this.name = name;
this.no = no;
}
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 + "]";
}
//递归删除结点
//1、如果删除的结点是叶子结点,则删除该结点
//2、如果删除的结点是非叶子结点,则删除该子树
public void delNode(int no)
{
/**
* 思路:
* 1、因为我们的二叉树是单向的,所以我们是判断当前结点的子节点是否需要删除结点,而不能去判断当前这个结点是不是需要删除的结点
* 2、如果当前结点的左子结点不为空,并且左子结点就是要删除的结点,就将this.left = null;并且就返回(结束递归删除)
* 3、如果当前结点的右子结点不为空,并且右子结点就是要删除的结点,就将this.right = null;并且就返回(结束递归删除)
* 4、如果第2步和第3步没有删除结点,那么我们就需要向左子树进行递归删除
* 5、如果第4步也没有删除结点,则应当向右子树进行递归删除
*/
//2、如果当前结点的左子结点不为空,并且左子结点就是要删除的结点,就将this.left = null;并且就返回(结束递归删除)
if(this.left != null && this.left.no == no)
{
this.left = null;
return;
}
//3、如果当前结点的右子结点不为空,并且右子结点就是要删除的结点,就将this.right = null;并且就返回(结束递归删除)
if(this.right != null && this.right.no == no)
{
this.right = null;
return;
}
//4、如果第2步和第3步没有删除结点,那么我们就需要向左子树进行递归删除
if(this.left != null)
{
this.left.delNode(no);
}
//5、如果第4步也没有删除结点,则应当向右子树进行递归删除
if(this.right != null)
{
this.right.delNode(no);
}
}
//前序遍历的方法
//比较4次
public void preOrder()
{
System.out.println(this); //先输出父节点
//递归左子树前序遍历
if(this.left != null)
{
this.left.preOrder();
}
//递归右子树前序遍历
if(this.right != null)
{
this.right.preOrder();
}
}
}