使用前序,中序,后序的方式来查询指定的结点
前序查找思路
1.先判断当前结点的no是否等于要查找的
2.如果是相等,则返回当前结点
3.如果不等,则判断当前结点的左子节点是否为空,如果不为空,则递归前序查找
4.如果左递归前序查找,找到结点,则返回,否继续判断,当前的结点的右子节点是否为空,如果不空,则继续向右递归前序查找.
中序查找思路
1.判断当前结点的左子节点是否为空,如果不为空,则递归中序查找
2.如果找到,则返回,如果没有找到,就和当前结点比较,如果是则返回当前结点,否则继续进行右递归的中序查找
3.如果右递归中序查找,找到就返回,否则返回null
后序查找思路
1.判断当前结点的左子节点是否为空,如果不为空,则递归后序查找
2.如果找到,就返回,如果没有找到,就判断当前结点的右子节点是否为空,如果不为空,则右递归进行后序查找,如果找到,就返回
3.就和当前结点进行,比如,如果是则返回,否则返回null
代码实现:
package tree;
public class BinaryTreeDemo {
public static void main(String[] args) {
//先需要创建一棵树
BinaryTree tree = 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);
tree.setRoot(root);
//测试
System.out.println("先序遍历");
tree.preOrder();
System.out.println("中序遍历");
tree.infixOrder();
System.out.println("后序遍历");
tree.postOrder();
//前序遍历
System.out.println("前序遍历方式");
HeroNode resNode = tree.preOrderSearch(3);
if (resNode != null){
System.out.printf("已经找到,信息为:no=%d name=%s\n",resNode.getNo(),resNode.getName());
}else {
System.out.println("未找到该节点!");
}
//中序遍历
System.out.println("中序遍历方式");
resNode = tree.infixOrderSearch(2);
if (resNode != null){
System.out.printf("已经找到,信息为:no=%d name=%s\n",resNode.getNo(),resNode.getName());
}else {
System.out.println("未找到该节点!");
}
//后序遍历
System.out.println("后序遍历方式");
resNode = tree.postOrderSearch(1);
if (resNode != null){
System.out.printf("已经找到,信息为:no=%d name=%s\n",resNode.getNo(),resNode.getName());
}else {
System.out.println("未找到该节点!");
}
}
}
//定义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 (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;
}
}
}
//先创建HeroNode节点
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);
}
//前序遍历查找
/**
* @param no 要查找的编号
* @return 查找到元素就返回该节点,没找到就返回null
* */
public HeroNode preOrderSearch(int no){
//比较当前节点是不是
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;
}
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.infixOrderSearch(no);
}
if (resNode != null){
return resNode;
}
if (this.right != null){
resNode = this.right.infixOrderSearch(no);
}
if (resNode != null){
return resNode;
}
if (this.no == no){
return this;
}
return resNode;
}
}