data structure to achieve the java

大二算法设计实验源码，内容包括线性时间选择，01背包，骑士巡游，最小生成树-Experimental Algorithm Design sophomore source, including choice of linear time, 01 backpacks, Cavalier Parade, minimum spanning tree

很精典的与数据库连接的管理程序-very classic and the database connection management process

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

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af

数据库系统：访问数据库。访问数据库并能对出错进行捕捉-database system : access to the database. Access to the database and is able to capture for mistakes

如果车不动，请算法设计：乘日本马但车不能吃，设计回溯用马走，并打印出距离。可作为设计软件的参考

计算机编程艺术第二卷，学习数据结构与算法的好书，喜欢的朋友可以-Art of Computer Programming Volume II, learning data structures and algorithms books, like friends can

机器学习的基础在于分类与聚类，此处分享三种聚类算法，matlab平台

C++ Builder程序员学习数据结构第2章-Builder C programmers to learn data structure Chapter 2

集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？-problem given a container, its length L, width W and H for high, existing batch of cylindrical wood and each timber are long L, but different radius, based i-radius of the wood-ri. Asked how crates, containers make maximum utilization of space?