本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各...

一个实用的数据库实例，采用ODBC接口，对初学者有很大帮助-a practical example of a database, using ODBC interface for beginners will be of great help

数据结构，清华大学出版社，课件，严蔚敏编著-Data structure, Tsinghua University Press, courseware, edited by Yan Wei-min

这是一个用CUDA平台实现的简单的排序。具有参考价值-This is a simple to use CUDA platform of the sort. With a reference value

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

数据结构实验报告！-report!

最短路径2 是有关数据结构的知识 但是程序稍稍有一个小小的失误-Shortest Path 2 is the data structure of knowledge but the procedures are a little bit errors

由系统随机建立一个迷宫,然后屏幕输出路径。为在完成作业的同时复习所学过的内容,完成一条路径的时候用到了递归的方法 而做全部路径的时候用非递归的方法。用户界面友好，有用户使用说明.每一步操作都有说明与提示。程序运行通过，有详细的解释说明-system by the establishment of a random maze, and then screen output path. For the complete review of operations at the same time have learned from the contents of a complete path of the use of recursive method to do all the time path of non- recursive method. User friendly interface, users note. Every step of the operation have notes and hints. Running through a detailed explanation of

1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括"商品编码"、"商品名称",且以"商品编码"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为"生成的商品"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial produ

数据结构大型作业实验报告-哈夫漫-data structure large operations Experimental Report-Halff Man

这是我在英国的C语言导师自己所写的一个二叉树的程序。-This is a binary-tree programme written by my tutor in England.