    public static int i = 1, j = 1, k =1;//编写前序查找方法public HeroNode preOrderSearch(int no){System.out.println("前序遍历"+(i++)+"次");if (this.no == no){return this;}HeroNode heroNode = null;if (this.left != null){heroNode = this.left.preOrderSearch(no);}//不等于空说明在左边找到了if (heroNode != null){return heroNode;}if (this.right != null){heroNode = this.right.preOrderSearch(no);}return heroNode;}//中序遍历查找public HeroNode infixOrderSearch(int no){HeroNode heroNode = null;//先判断当前节点的左子节点是否为空，不为空继续进行中序查找if (this.left != null){heroNode = this.left.infixOrderSearch(no);}if (heroNode != null){return heroNode;}System.out.println("中序遍历"+(j++)+"次");if (this.no == no){return this;}if (this.right != null){heroNode = this.right.infixOrderSearch(no);}return heroNode;}//后序遍历查找public HeroNode postOrderSearch(int no){HeroNode heroNode = null;//判断当前节点的左子节点是否为空，不为空，则递归后序遍历查找if (this.left != null){heroNode = this.left.postOrderSearch(no);}if (heroNode != null){return heroNode;}//判断当前节点的右子节点是否为空，不为空，则递归后序遍历查找if (this.right != null){heroNode = this.right.postOrderSearch(no);}if (heroNode != null){return heroNode;}System.out.println("后序遍历"+(k++)+"次");//左右子树都没有找到，比较当前节点是不是if (this.no == no){return this;}return heroNode;}

 //前序查找public HeroNode preOrederSearch(int no){if (root != null){return root.preOrderSearch(no);}else {return null;}}//中序查找public HeroNode infixOrderSeach(int no){if (root != null){return root.infixOrderSearch(no);}else {return null;}}//后序查找public HeroNode postOrderSeach(int no){if (root != null){return root.postOrderSearch(no);}else {return null;}}

完整代码

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, "关胜");//说明，先手动创建该二叉树，后面学习递归方式创建二叉树binaryTree.setRoot(root);root.setLeft(node2);root.setRight(node3);node3.setRight(node4);node3.setLeft(node5);//测试
//        System.out.println("前序遍历");
//        binaryTree.preOrder();
//        System.out.println("中序遍历");
//        binaryTree.infixOrder();
//        System.out.println("后序遍历");
//        binaryTree.postOrder();//测试查找//前序遍历查找System.out.println("前序遍历查找：~~~~");HeroNode heroNode1 = binaryTree.preOrederSearch(5);if (heroNode1 != null){System.out.println("找到节点：" + heroNode1.toString());}else {System.out.println("没有找到");}//        //中序遍历查找System.out.println("中序遍历查找：~~~~");HeroNode heroNode2 = binaryTree.infixOrderSeach(5);if (heroNode2 != null){System.out.println("找到节点：" + heroNode2.toString());}else {System.out.println("没有找到");}//后序遍历查找System.out.println("后序遍历查找：~~~~");HeroNode heroNode3 = binaryTree.postOrderSeach(5);if (heroNode3 != null){System.out.println("找到节点：" + heroNode3.toString());}else {System.out.println("没有找到");}}
}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 preOrederSearch(int no){if (root != null){return root.preOrderSearch(no);}else {return null;}}//中序查找public HeroNode infixOrderSeach(int no){if (root != null){return root.infixOrderSearch(no);}else {return null;}}//后序查找public HeroNode postOrderSeach(int no){if (root != null){return root.postOrderSearch(no);}else {return null;}}}
class HeroNode{private int no;private String name;private HeroNode left;//默认nullprivate 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;}@Overridepublic 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 static int i = 1, j = 1, k =1;//编写前序查找方法public HeroNode preOrderSearch(int no){System.out.println("前序遍历"+(i++)+"次");if (this.no == no){return this;}HeroNode heroNode = null;if (this.left != null){heroNode = this.left.preOrderSearch(no);}//不等于空说明在左边找到了if (heroNode != null){return heroNode;}if (this.right != null){heroNode = this.right.preOrderSearch(no);}return heroNode;}//中序遍历查找public HeroNode infixOrderSearch(int no){HeroNode heroNode = null;//先判断当前节点的左子节点是否为空，不为空继续进行中序查找if (this.left != null){heroNode = this.left.infixOrderSearch(no);}if (heroNode != null){return heroNode;}System.out.println("中序遍历"+(j++)+"次");if (this.no == no){return this;}if (this.right != null){heroNode = this.right.infixOrderSearch(no);}return heroNode;}//后序遍历查找public HeroNode postOrderSearch(int no){HeroNode heroNode = null;//判断当前节点的左子节点是否为空，不为空，则递归后序遍历查找if (this.left != null){heroNode = this.left.postOrderSearch(no);}if (heroNode != null){return heroNode;}//判断当前节点的右子节点是否为空，不为空，则递归后序遍历查找if (this.right != null){heroNode = this.right.postOrderSearch(no);}if (heroNode != null){return heroNode;}System.out.println("后序遍历"+(k++)+"次");//左右子树都没有找到，比较当前节点是不是if (this.no == no){return this;}return heroNode;}
}

后序遍历查找最快

数据结构 - 二叉树(前序中序后序查找)相关推荐

二叉树前序遍历，后序遍历
求前序遍历 Description 给出一棵二叉树的中序和后序遍历,求它的前序遍历.(树结点用不同的大写字母表示,长度小于等于26.) Input 本问题有多组测试数据,每组测试数据有两行,每行都是由 ...
二叉树前序遍历与后序遍历
二叉树前序遍历递归借助栈进行排序先将根节点压栈栈不为空,如果存在根节点,先右后左. 弹栈打印.直至栈为空 package com.vitamin.tree;import java.util. ...
【二叉树Java】二叉树遍历前序中序后序遍历的非递归写法
本文主要介绍二叉树前序中序后序遍历的非递归写法在探讨如何写出二叉树的前序中序后序遍历代码之前,我们先来明确一个问题,前序中序后序遍历根据什么区分? 二叉树的前序中序后序遍历,是相较根节点说的.最先遍 ...
二叉树中前序中序后序的互推
最近开始复习数据结构,就从二叉树开始吧 1.复习前序中序后序结构: 前序:根(左子树)(右子树) 中序:(左子树)根 (右子树) 后序:(左子树)(右子树)根 2. 前序+中序->后序由 ...
用前序中序创建二叉树（用中序后序创建二叉树）
定义二叉树结点比如就拿这个二叉树前序中序创建因为前序遍历的顺序是根 , 左 ,右. 中序的遍历是左根右. 我们会很不好想,但我们可以用前序和中序把上面那个二叉树的遍历一边前序遍历:AB ...
二叉树前序中序，后序中序，公共最近祖先的实现
二叉树前序中序,后序中序,公共最近祖先的实现注释中详细介绍了算法,故不再赘述. 无论是前序还是后序,一个节点的左子树和右子树都是可以看做是分开的,有一定规律可循,故可用递归进行实现. #includ ...
二叉树的深度（前序中序后序递归非递归搜素）、广度、搜索 C++
a b c 使用 1 2 3 表示 /* 描述:二叉树的深度(前序中序后序递归非递归搜素).广度.搜索作者:jz 日期:20140819 */ #include<stdio.h> ...
前序中序、中序后序以及前序后序构造二叉树
文章目录前序中序中序后序前序后序定义的树节点如下, class TreeNode {int val;TreeNode left;TreeNode right;TreeNode(int x) { ...
序列化和反序列化二叉树 -----前序,中序,后序,层序
目录一.序列化和反序列化 1.什么是序列化和反序列化二.前序遍历 1.序列化 1.问题分析 2.代码实现 2.反序列化 1.问题分析 2.代码实现三.后序遍历 1.序列化 1.思路分析 2.代码 ...

数据结构 - 二叉树(前序中序后序查找)

完整代码

后序遍历查找最快

数据结构 - 二叉树(前序中序后序查找)相关推荐

最新文章

热门文章