基本概念
代码
package tree;
//二叉树
public class BinaryTreeDemo {
public static void main(String[] args) {
//创建一颗二叉树
BinaryTree binaryTree = new BinaryTree();
//创建节点
HeroNode root = new HeroNode(1,"root号节点");
HeroNode node2 = new HeroNode(2,"2号节点");
HeroNode node3 = new HeroNode(3,"3号节点");
HeroNode node4 = new HeroNode(4,"4号节点");
//手动搭建二叉树
root.setLeft(node2);
root.setRight(node3);
node3.setRight(node4);
binaryTree.setRoot(root);
//测试
System.out.println("前序遍历");//1,2,3,4
binaryTree.perOrder();
System.out.println("中序遍历");//2,1,3,4
binaryTree.infixOrder();
System.out.println("后序遍历");//2,4,3,1
binaryTree.postOrder();
}
}
//定义一个节点
class HeroNode{
private int no;
private String name;
private HeroNode left;//默认null
private HeroNode right;//默认null
//构造器
/**
* @param no 编号
* @param name
*/
public HeroNode(int no, String name) {
super();
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;
}
//重写toString
@Override
public String toString() {
return "HeroNode [no=" + no + ", name=" + name + "]";
}
//编写前序遍历方法
public void perOrder() {
//先输出当前节点
System.out.println(this);
//向左递归调用
if(this.left != null) {
this.left.perOrder();
}
//向右
if(this.right != null) {
this.right.perOrder();
}
}
//编写中序遍历方法
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);
}
}
//定义BinaryTree二叉树
class BinaryTree{
//定义根节点
private HeroNode root;
//外界设置根节点方法
public void setRoot(HeroNode root) {
this.root = root;
}
//前序遍历
public void perOrder() {
if(this.root != null) {
this.root.perOrder();
}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("二叉树为空");
}
}
}