9.2二叉排序树 页码P211package hicc.ds.c09_find;import hicc.ds.c06_bitree.BiTree;class STS { BiTree t; int flag; public STS(BiTree t, int status) { this.t = t; this.flag = status; } @Ove...

6.2.2 二叉树的基本操作与实现页码P111package hicc.ds.c06_bitree;public class BiTree { public Object data; public BiTree lchild; public BiTree rchild; public BiTree() { } public BiTree(Object da...

【例 3-22】 采用队列的迷宫算法 页码P61package hicc.ds.c02_linear2;import java.util.Arrays;class Sign { int x, y; int pre; @Override public String toString() { return "(" + x + ", " + y + ", " + pr...

【例 3-2】 利用栈实现迷宫的求解页码P47package hicc.ds.c02_linear2;class Step { public int x, y, d; public Step(int x, int y, int d) { this.x = x; this.y = y; this.d = d; } @Override public Stri...

3.2.2 (2)链队页码P58package hicc.ds.c02_linear2;public class LinkQueue { //带头结点的链队 private LNode front, rear; public LinkQueue() { //初始化 front = rear = new LNode(null); } public void inLi...

3.2.2 (1)顺序队页码P55package hicc.ds.c02_linear2;import java.util.Arrays;public class SeQueue { //循环队列，使用num记录元素个数判断队满 private int maxSize = 10; //最大存储长度 private Object[] data = new Object[max...

3.1.2 (2)链栈 页码P44package hicc.ds.c02_linear2;class LNode { Object data; LNode next; public LNode(Object data) { this.data = data; this.next = null; }}public class LinkStack { privat...

3.1.2 (1)顺序栈 页码P42package hicc.ds.c02_linear2;import java.util.Arrays;public class SeqStack { private int maxSize = 10; //最大存储长度 private Object[] data = new Object[maxSize]; //顺序栈的存储空间 pri...

2.3.1 单链表 P24package hicc.ds.c02_linear;class LNode { Object data; LNode next; public LNode(Object data) { this.data = data; this.next = null; }}public class LinkList { private LNod...

package hicc.ds.c02_linear;import java.util.Arrays;public class SeqList { private int maxSize = 10; //最大存储长度 private Object[] data = new Object[maxSize]; //顺序表的存储空间 private int last; //最后元素的位置...