目录
- 前序遍历: 先输出父节点, 再遍历左子树和右子树
- 中序遍历: 先遍历左子树, 再输出父节点, 再遍历右子树
- 后序遍历: 先遍历左子树, 再遍历右子树, 最后输出父节点
1: 求序列问题
答案:ABCDGEIHFJK
绘图如下:
package com.atguigu.tree;
public class linshi {
public static void main(String[] args) {
BinaryTree binaryTree = new BinaryTree();
HeroNode root = new HeroNode(1, "A");
HeroNode node2 = new HeroNode(2, "B");
HeroNode node3 = new HeroNode(3, "I");
HeroNode node4 = new HeroNode(4, "C");
HeroNode node5 = new HeroNode(5, "G");
HeroNode node6 = new HeroNode(6, "H");
HeroNode node7 = new HeroNode(7, "J");
HeroNode node8 = new HeroNode(8, "D");
HeroNode node9 = new HeroNode(9, "E");
HeroNode node10 = new HeroNode(10, "F");
HeroNode node11 = new HeroNode(11, "K");
root.setLeft(node2);
root.setRight(node3);
node2.setLeft(node4);
node2.setRight(node5);
node3.setLeft(node6);
node3.setRight(node7);
node4.setLeft(node8);
node5.setRight(node9);
node6.setRight(node10);
node7.setRight(node11);
binaryTree.setRoot(root);
System.out.println("前序遍历");
binaryTree.preOrderEntity();
System.out.println("中序遍历");
binaryTree.infixOrderEntity();
System.out.println("后序遍历");
binaryTree.postOrderEntity();
}
}
class BinaryTree{
private HeroNode root; //根节点
public void setRoot(HeroNode root){
this.root = root;
}
//前序遍历
public void preOrderEntity(){
if(this.root != null){
this.root.preOrder();
}else{
System.out.println("二叉树为空,无法遍历");
}
}
//中序遍历
public void infixOrderEntity(){
if(this.root != null){
this.root.infixOrder();
}else{
System.out.println("二叉树为空,无法遍历");
}
}
//后序遍历
public void postOrderEntity(){
if(this.root != null){
this.root.postOrder();
}else{
System.out.println("二叉树为空,无法遍历");
}
}
}
class HeroNode{
private int no;
private String name;
private HeroNode left;
private HeroNode right;
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); //先输出父节点
}
}
2:查找与删除功能
代码演示删除3号节点下子树
package com.atguigu.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("前序遍历");//1 2 3 5 4
// binaryTree.preOrderEntity();
// System.out.println("中序遍历");//2 1 5 3 4
// binaryTree.infixOrderEntity();
// System.out.println("后序遍历");//2 5 4 3 1
// binaryTree.postOrderEntity();
//前序查找 4次
// System.out.println("前序查找");
// HeroNode resNode = binaryTree.preOrderSearch(5);
// if(resNode != null) {
// System.out.printf("找到了,no: %d name: %s ",resNode.getNo(),resNode.getName());
// }else {
// System.out.printf("没找到,no为 %d 的英雄 ",5);
// }
//中序遍历 3次
// 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);
// }
//后序遍历 2次
// System.out.println("后序查找");
// HeroNode resNode = binaryTree.postOrderSearchEntity(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.preOrderEntity();// 1 2 3 5 4
// binaryTree.delNodeEntity(5);
binaryTree.delNodeEntity(3);
System.out.println("删除之后,前序遍历~");
binaryTree.preOrderEntity();// 1 2 3 4
}
}
//定义一个二叉树
class BinaryTree{
private HeroNode root; //根节点
public void setRoot(HeroNode root){
this.root = root;
}
//删除节点
public void delNodeEntity(int no) {
if(root!=null) {
//如果只有一个root结点,这里立即判断root是不是要删除的节点
if(root.getNo()==no) {
root = null;
}else {
//递归删除
root.delNode(no);
}
}else {
System.out.println("空树,不能删除~~");
}
}
//前序遍历
public void preOrderEntity(){
if(this.root != null){
this.root.preOrder();
}else{
System.out.println("二叉树为空,无法遍历");
}
}
//中序遍历
public void infixOrderEntity(){
if(this.root != null){
this.root.infixOrder();
}else{
System.out.println("二叉树为空,无法遍历");
}
}
//前序遍历
public void postOrderEntity(){
if(this.root != null){
this.root.postOrder();
}else{
System.out.println("二叉树为空,无法遍历");
}
}
//前序查找
public HeroNode preOrderSearchEntity(int no) {
if(root != null) {
return root.preOrderSearch(no);
}else {
return null;
}
}
//中序查找
public HeroNode infixOrderSearchEntity(int no) {
if(root != null) {
return root.infixOrderSearch(no);
}else {
return null;
}
}
//后序查找
public HeroNode postOrderSearchEntity(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.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 delNode(int no) {
if(this.left!=null && this.left.no==no) {
this.left = null;
return;
}
if(this.right!=null && this.right.no==no) {
this.right = null;
return;
}
if(this.left != null) {
this.left.delNode(no);
}
if(this.right != null) {
this.right.delNode(no);
}
}
//前序遍历的方法
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); //先输出父节点
}
//前序查找 根据no查找
/**
* @param no 查找no
* @return 如果找到就返回Node,否则返回null
*/
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;
}
//中序查找 根据no查找
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;
}
//后序查找 根据no查找
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;
}
}