资源列表
erchashu
- 二叉树求节点的个数并输出节点，输入的二叉树要安先序遍历输入，一点表示空-Seek binary tree the number of nodes and output nodes, the input binary tree to safety first traversal input point represents empty
Insertion-and-deletion
- 顺序表的插入和删除，虽然有点简单。但是，成功的运用c语言的基本的知识。-Insertion and deletion of the sequence table, though a bit simple. However, successful use of basic knowledge of C language.
hibernate
- Hibernate基础系统讲解，可以帮助读者更深入的学习Hibernate-Hibernate base system to explain, you can help the reader to more in-depth learning Hibernate
Java_DataMing
- 应用递归思想，完成深度优先的递归，当完成递归后，生成决策树。最后根据决策树，作出决策-Application of recursive thinking, complete depth-first recursive, generated after the completion of recursive decision tree. Finally, decision trees, decision-making
BiTree
- 1、用前序方法建立一棵二叉树。 2、编写前序遍历二叉树的程序。 3、编写中序遍历二叉树的程序。 4、编写后序遍历二叉树的程序。 5、编写统计二叉树叶子结点个数的程序 -A pre-order methods, the establishment of a binary tree. 2, the preparation of pre-order traversal binary tree program. 3, write the preorder traversal bina
xunhuancharupaixu
- 读入SIZE以内个整数，对其排序。可循环插入一个整数，重新排序-Read into the SIZE less than an integer, its sort. Can be recycled to insert an integer, reordering
Tmazeziph
- 运用面向对象程序设计编写的迷宫19*19的。自动生成迷迷宫地图，自动走出，显示走出路径，已通过测试。 -The use of object-oriented programming to write the maze 19* 19. Automatic generation of fans maze map, automatic out, showing out of the path has been tested.
TDIJKSTRAAsh
- 这是一个求最短路的算法，用DIIJKSTRA的方法可直接使用。 -This is a request to the shortest path algorithm, DIIJKSTRA the method can be used directly.
Lhheap_dji
- 使用堆+链表实现dijksttra,求单源最短路可直接使用。 -The heap+ linked list dijksttra seeking single-source shortest path can be used directly.
DDDijkstrai
- Dijkstra算法，解决最短短路径问题，由文本文件输入路的长短 -Dijkstra algorithm to solve the most short path problem, the length of the road from the text file input
CPP
- 教程 可以看着里面的PPT自学c语言，省去了去查阅书籍的麻烦-The tutorial can look inside the PPT self-c language, eliminating the trouble of access to books
stack-data-structure
- 数据结构中堆栈的演示 非常详细和简单 可以供大家参考下-Demonstration stack data structure for your reference