optional-project-blackjact

关于二叉树的一些相关代码，运用链表的形式，求二叉树的高度，结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)

数据结构一书上 关于迷宫游戏的算法 (Book on data structure algorithms on maze game)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)

一个KDtree的程序，包含建树过程和消耗的时间。(A KDtree procedures, including the contribution to the process and time consuming.)

链表的模板类,提供插入删除，遍历器，查找等功能，只有一个头文件，可以包含到你的工程(template implemention of Chain)

单链表逆置的源码~提供了源码和源码说明~简单实用，适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)