Data structure demonstration (tc)

/* Several tc demos written some time ago, some of which are used in <C language curriculum design case series> in cooperation with teacher Guo Cuiying, therefore, the source code cannot be released at will. The program topic is listed here. Because there is no experience, it is useless to create a project to write this program, if you still have the opportunity to use tc to write programs that are slightly larger, you should pay attention to this. Using tc to practice these procedures is also a review of the data structure I learned last semester. I personally feel that writing similar programs can increase my interest in learning, and on the one hand, I can also move my mind.
You can think about other interesting demos!

*/

/* Shanghai University of Engineering and Technology 02211 Zhu Zhe */

# Include "ysfun. c"/* common software functions, such as input and output functions */
# Include "yshead. c"/* Display the start part of the demo software */
# Include "rjend. c"/* prompts after the end */
/************************ The order must be ************ *******************/
# Include "f5.c"/* F5 functions */
# Include "ysmaopao. c"/* bubble method demonstration */
# Include "queen. c"/* specific queen issue */
# Include "hanoi. c"/* specific Tower issue */
# Include "maze1.c"/* not the shortest path of the maze */
# Include "jssort. c"/* base sorting */
# Include "tree2.c"/* binary tree traversal demonstration */
# Include "slsort. c"/* bidirectional linked list Insertion sorting */
# Include "yser. c"/* binary search demo */
# Include "maze2.c"/* labyrinth shortest path */
# Include "clist. c"/* report number problem */
# Include "slsort2.c"/* double-link table selection and sorting */
# Include "insort. c"/* insert sort */
# Include "qsort. c"/* quick sort demonstration */
# Include "tushort. c"/* link matrix to find the shortest path */
# Include "merge. c"/* merge and sort */
# Include "fib. c"/* fibonacci problems */
# Include "findtree. c"/* search tree */
# Include "car. c"/* car entry guide */
# Include "hor. c"/* stepping board */
# Include "clock. c"/* clock */
# Include "kuopo. c"/* topological sorting */
# Include "dsort. c"/* heap sorting */
# Include "huffman. c"/* huffman tree */
# Include "juzhch. c"/* matrix conversion */
# Include "cxtree. c"/* threading tree */
# Include "xesort. c"/* Hill sorting */
# Include "dolist. c"/* single-chain table insertion */
# Include "maze3.c"/* seek to implement a maze in four directions */
# Include "bds. c"/* expression solving */
# Include "jzadd. c"/* coefficient matrix addition */
Void OdinaryData ()/* normal demonstration */
{
Char flag = 0;
ClrScr ();
HZ12 (50, 50, 20, 0, "A. Matrix transpose ");
HZ12 (50, 80, 20, 0, "B. Threading tree generation ");
HZ12 (50,110, 20, 0, "C. Single-link table insertion node ");
HZ12 (50,140, "D. Ternary matrix addition ");
Flag = Chose (200,350, 1);/* enter the selected content */
ClrScr ();
If (flag = 'a' | flag = 'a')/* matrix transpose */
JuChangeMain ();
If (flag = 'B' | flag = 'B')/* threading tree */
CxtreeMain ();
If (flag = 'C' | flag = 'C ')
DolistMain ();/* single-link insertion node */
If (flag = 'd' | flag = 'd ')
JzaddMain ();/* coefficient matrix addition */
ClrScr ();
}
Void GoodCtext ()/* F2 classic example */
{
Char flag = 0;
ClrScr ();
HZ12 (50, 50, 20, 0, "A. Queen question (Test )");
HZ12 (50, 80, 20, 0, "B. Tower problems ");
HZ12 (50,110, 20, 0, "C. Exploring the Maze ");
HZ12 (50,140, "D. Shortest path of maze exploration ");
HZ12 (50,170, 20, 0,