请编写前序查找,中序查找和后序查找的方法,分别使用三种查找方式,查找 num = 5 的节点
我们一这样一棵二叉树为例
一、前序查找
实现思路:
- 先判断当前节点的num是否等于要查找的,如果相等,则返回当前节点
- 如果不相等,则判断当前节点的左子节点是否为空,如果不为空,则递归前序查找
- 如果左递归前序查找找到节点则返回该节点,否则继续判断当前节点的右子节点是否为空,如果不为空,则继续右递归前序查找
代码实现:
public class BinaryTreeDemo {
public static void main(String[] args) {
BinaryTree binaryTree = new BinaryTree();
PersonNode root = new PersonNode(1, "张三");
PersonNode node2 = new PersonNode(2, "李四");
PersonNode node3 = new PersonNode(3, "王五");
PersonNode node4 = new PersonNode(4, "赵六");
PersonNode node5 = new PersonNode(5, "田七");
root.setLeft(node2);
root.setRight(node3);
node3.setLeft(node4);
node3.setRight(node5);
binaryTree.setRoot(root);
System.out.println("前序查找:");
PersonNode personNode = binaryTree.preOrderSearch(4);
System.out.println(personNode);
}
}
class BinaryTree {
private PersonNode root;
public void setRoot(PersonNode root) {
this.root = root;
}
//前序查找
public PersonNode preOrderSearch(int num) {
if (this.root != null) {
return root.preOrderSearch(num);
} else {
return null;
}
}
}
class PersonNode {
private int num;
private String name;
private PersonNode left;
private PersonNode right;
public PersonNode() {
}
public PersonNode(int num, String name) {
this.num = num;
this.name = name;
}
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public PersonNode getLeft() {
return left;
}
public void setLeft(PersonNode left) {
this.left = left;
}
public PersonNode getRight() {
return right;
}
public void setRight(PersonNode right) {
this.right = right;
}
@Override
public String toString() {
return "PersonNode{" +
"num=" + num +
", name='" + name + '\'' +
'}';
}
//前序查找
public PersonNode preOrderSearch(int num) {
//先判断当前节点的num是否等于要查找的,如果相等,则返回当前节点
if (this.num == num) {
return this;
}
//如果不相等,则判断当前节点的左子节点是否为空,如果不为空,则递归前序查找
PersonNode resNode = null; //定义一个节点用来存储查找结果
if (this.left != null) {
resNode = this.left.preOrderSearch(num);
}
if (resNode != null) {
return resNode;
}
//如果左递归前序查找找到节点则返回该节点,否则继续判断当前节点的右子节点是否为空,如果不为空,则继续右递归前序查找
if (this.right != null) {
resNode = this.right.preOrderSearch(num);
}
return resNode;
}
}
二、中序查找
实现思路:
- 判断当前节点的左子节点是否为空,如果不为空,则递归中序查找,如果找到则返回
- 如果左递归没有找到,则和当前节点进行比较,如果num和当前节点的num相等则返回当前节点
- 若不相等,则继续进行右递归中序查找,找到就返回,否则返回null
public class BinaryTreeDemo {
public static void main(String[] args) {
BinaryTree binaryTree = new BinaryTree();
PersonNode root = new PersonNode(1, "张三");
PersonNode node2 = new PersonNode(2, "李四");
PersonNode node3 = new PersonNode(3, "王五");
PersonNode node4 = new PersonNode(4, "赵六");
PersonNode node5 = new PersonNode(5, "田七");
root.setLeft(node2);
root.setRight(node3);
node3.setLeft(node4);
node3.setRight(node5);
binaryTree.setRoot(root);
System.out.println("中序查找:");
PersonNode personNode = binaryTree.midOrderSearch(4);
System.out.println(personNode);
}
}
class BinaryTree {
private PersonNode root;
public void setRoot(PersonNode root) {
this.root = root;
}
//中序查找
public PersonNode midOrderSearch(int num) {
if (this.root != null) {
return root.midOrderSearch(num);
} else {
return null;
}
}
}
class PersonNode {
private int num;
private String name;
private PersonNode left;
private PersonNode right;
public PersonNode() {
}
public PersonNode(int num, String name) {
this.num = num;
this.name = name;
}
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public PersonNode getLeft() {
return left;
}
public void setLeft(PersonNode left) {
this.left = left;
}
public PersonNode getRight() {
return right;
}
public void setRight(PersonNode right) {
this.right = right;
}
@Override
public String toString() {
return "PersonNode{" +
"num=" + num +
", name='" + name + '\'' +
'}';
}
//中序查找
public PersonNode midOrderSearch(int num) {
//1. 判断当前节点的左子节点是否为空,如果不为空,则递归中序查找,如果找到则返回
PersonNode resNode = null;
if (this.left != null) {
resNode = this.left.midOrderSearch(num);
}
if (resNode != null) {
return resNode;
}
//2. 如果左递归没有找到,则和当前节点进行比较,如果num和当前节点的num相等则返回当前节点
if (this.num == num) {
return this;
}
//3. 若不相等,则继续进行右递归中序查找,找到就返回,否则返回null
if (this.right != null) {
resNode = this.right.midOrderSearch(num);
}
if (resNode != null) {
return resNode;
}
return null;
}
}
三、后序查找
实现思路:
- 判断当前节点的左子节点是否为空,如果你不为空,则递归后序查找,如果找到,就返回该节点
- 如果没有找到,就判断当前节点的右子节点是否为空。如果不为空,则右递归进行后序查找,如果找到就返回
- 和当前节点进行比较,如果是则返回,否则返回null
public class BinaryTreeDemo {
public static void main(String[] args) {
BinaryTree binaryTree = new BinaryTree();
PersonNode root = new PersonNode(1, "张三");
PersonNode node2 = new PersonNode(2, "李四");
PersonNode node3 = new PersonNode(3, "王五");
PersonNode node4 = new PersonNode(4, "赵六");
PersonNode node5 = new PersonNode(5, "田七");
root.setLeft(node2);
root.setRight(node3);
node3.setLeft(node4);
node3.setRight(node5);
binaryTree.setRoot(root);
System.out.println("后序查找:");
PersonNode personNode = binaryTree.postOrderSearch(4);
System.out.println(personNode);
}
}
class BinaryTree {
private PersonNode root;
public void setRoot(PersonNode root) {
this.root = root;
}
//后序查找
public PersonNode postOrderSearch(int num) {
if (this.root != null) {
return root.postOrderSearch(num);
} else {
return null;
}
}
}
class PersonNode {
private int num;
private String name;
private PersonNode left;
private PersonNode right;
public PersonNode() {
}
public PersonNode(int num, String name) {
this.num = num;
this.name = name;
}
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public PersonNode getLeft() {
return left;
}
public void setLeft(PersonNode left) {
this.left = left;
}
public PersonNode getRight() {
return right;
}
public void setRight(PersonNode right) {
this.right = right;
}
@Override
public String toString() {
return "PersonNode{" +
"num=" + num +
", name='" + name + '\'' +
'}';
}
//后序查找
public PersonNode postOrderSearch(int num) {
//1. 判断当前节点的左子节点是否为空,如果你不为空,则递归后序查找,如果找到,就返回该节点
PersonNode resNode = null;
if (this.left != null) {
resNode = this.left.postOrderSearch(num);
}
if (resNode != null) {
return resNode;
}
//2. 如果没有找到,就判断当前节点的右子节点是否为空。如果不为空,则右递归进行后序查找,如果找到就返回
if (this.right != null) {
resNode = this.right.postOrderSearch(num);
}
if (resNode != null) {
return resNode;
}
//3. 和当前节点进行比较,如果是则返回,否则返回null
if (this.num == num) {
return this;
}
return null;
}
}
三种查找方式都能查找到PersonNode{num=4, name='赵六'}
节点
四、删除结点
实现思路:
- 因为我们的二叉树是单向的,所以我们是判断当前结点的子结点是否需要删除结点,而不能去判断当前这个结点是不是需要删除结点.
- 如果当前结点的左子结点不为空,并且左子结点 就是要删除结点,就将this.left = null; 并且就返回(结束递归删除)
- 如果当前结点的右子结点不为空,并且右子结点 就是要删除结点,就将this.right= null ;并且就返回(结束递归删除)
- 如果第2和第3步没有删除结点,那么我们就需要向左子树进行递归删除
- 如果第4步也没有删除结点,则应当向右子树进行递归删除
代码实现:
public class BinaryTreeDemo {
public static void main(String[] args) {
BinaryTree binaryTree = new BinaryTree();
PersonNode root = new PersonNode(1, "张三");
PersonNode node2 = new PersonNode(2, "李四");
PersonNode node3 = new PersonNode(3, "王五");
PersonNode node4 = new PersonNode(4, "赵六");
PersonNode node5 = new PersonNode(5, "田七");
root.setLeft(node2);
root.setRight(node3);
node3.setLeft(node4);
node3.setRight(node5);
binaryTree.setRoot(root);
System.out.println("前序遍历:");
binaryTree.preOrder();
//测试删除结点
binaryTree.delNode(5);
binaryTree.preOrder();
}
}
class BinaryTree {
private PersonNode root;
public void setRoot(PersonNode root) {
this.root = root;
}
//前序遍历
public void preOrder() {
if (root != null) {
root.preOrder();
} else {
System.out.println("二叉树为空,不能遍历");
}
}
//删除结点
public void delNode(int num) {
if (root != null) {
if (root.getNum() == num) {
root = null;
} else {
root.delNode(num);
}
} else {
System.out.println("空树,不能删除");
}
}
}
class PersonNode {
private int num;
private String name;
private PersonNode left;
private PersonNode right;
public PersonNode() {
}
public PersonNode(int num, String name) {
this.num = num;
this.name = name;
}
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public PersonNode getLeft() {
return left;
}
public void setLeft(PersonNode left) {
this.left = left;
}
public PersonNode getRight() {
return right;
}
public void setRight(PersonNode right) {
this.right = right;
}
@Override
public String toString() {
return "PersonNode{" +
"num=" + num +
", 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 delNode(int num) {
// 如果当前结点的左子结点不为空,并且左子结点 就是要删除结点,就将this.left = null; 并且就返回(结束递归删除)
if (this.left != null && this.left.num == num) {
this.left = null;
return;
}
// 如果当前结点的右子结点不为空,并且右子结点 就是要删除结点,就将this.right= null ;并且就返回(结束递归删除)
if (this.right != null && this.right.num == num) {
this.right = null;
return;
}
// 如果第2和第3步没有删除结点,那么我们就需要向左子树进行递归删除
if (this.left != null) {
this.left.delNode(num);
}
// 如果第4步也没有删除结点,则应当向右子树进行递归删除
if (this.right != null) {
this.right.delNode(num);
}
}
}
测试结果: