搜索资源列表
officexptoolbar
- 主要用于灵活可靠地生成任意复杂的DataWindow的Filter语句或SQL的Select语句中的Where查询条件。核心技术是采用面向对象方法分析了SQL的SELECT语句的语法结构，概括出基于表达式类的面向对象模型（包括字段，常数，函数，自定义表达式及二元表达式对象）。在查询界面中，用户可以灵活地创建、销毁、组合或拆分这些对象，构造出复杂多样的表达式树，有效地实现了数据库的动态查询。-mainly for flexible and reliable generation of arbitr
HuffmanTwoTree
- 实现数据的压缩，演示Huffman二叉树的应用。虽然压缩效果不如rar等，但是作为一种算法，具有可借鉴的价值。-data compression, presentations Huffman binary tree applications. Although not rar compression, but as an algorithm that can draw is the value.
aglo7-1
- 二叉树的基本算法。（1） 输出二叉树B； （2） 输出二叉树B的深度； （3） 输出H结点的左、右孩子结点值； （4） 输出二叉树B的宽度； （5） 输出二叉树B的结点个数； 输出二叉树B的叶子结点个数 -The basic algorithm for binary tree。(1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes
tree
- 二叉树的实现，三种遍历方法。比较简单，是数据结构的基本知识-The realization of a binary tree, the three traversal methods. Relatively simple, basic knowledge of the data structure
tree
- 创建二叉树并以根结点为参数交换每个结点的左右子树，查找x结点并输出其所有的祖先结点，以中序遍历和前序遍历创建二叉树。-Create a binary tree and parameter exchange for each node of the root node to the left and right subtree, find x nodes and output nodes of all its ancestors, create a binary tree in order tra
two
- 建立一棵二叉树，并对其进行遍历（先序、中序、后序），打印输出遍历结果。 从键盘接受输入（先序），以二叉链表作为存储结构，建立二叉树（以先序来建立），并采用递归算法对其进行遍历（先序、中序、后序），将遍历结果打印输出-Create a binary tree, and traverse the results of its traversal (preorder, inorder, postorder), print output. Accept input from the keyboard (
adaboost
- 以二叉树作为弱分类器的adaboost的matlab算法代码-Binary tree as weak classifier adaboost matlab algorithm code
1
- 此代码可以创建二叉树并求出叶子节点总数和节点总数-This code can create a binary tree and calculated the total number of leaf nodes and the total number of nodes
ECSBL
- C语言二叉树遍历，数据结构C语言描述，很简单的算法和代码-C language binary tree traversal
bitreejas
- 一个二叉树的建立及应用的源代码，并不是很高端-A binary tree establishment and application source code is not very high
CPP
- 二叉树实现的学生管理系统，已经测试过，大家可以一起学习！-Binary Tree' s student management system
erchashu
- 采用数组的方法，可以输入任意二叉树，并将全部二叉树的节点及其儿子输出-The method uses an array, you can enter any binary tree, and all the binary output node and son
erchapaixunshu
- 二叉树市一中简化的树形结构。利用此源代码可以以一定规则排序-Binary tree, one simplified tree structure. This source code can be used to sort at a certain rules
BinaryTree
- 循环遍历二叉树，相对于递归遍历二叉树更节省系统性能 摘自visual C++一书案例-Iterate over the binary tree, compared with the recursive traversal binary tree more economical performance of the system
exam9-4
- 实现二叉树的基本算法，并在此基础上，完成某些功能-The basic binary tree algorithm, and on this basis, to complete certain functions
btree
- 统计字符串中字符出现的次数，结果用二叉树来保存-Statistics string, number of characters appear, with the binary tree Save Results
printbitree
- 树状打印二叉树可以按照二叉树的形状打印出二叉树-Tree print tree can print out the shape of binary tree binary tree
turboc2_九子棋
- turboc2下的九子棋，人机对战的，用二叉树很麻烦，用了穷举-turboc2 the nine-game, man-machine players, a binary tree is cumbersome, with the exhaustive
printbitree
- 树状打印二叉树可以按照二叉树的形状打印出二叉树-Tree print tree can print out the shape of binary tree binary tree
数据结构课程设计源代码
- 编写一个程序，通过前缀表达式来构造一个与之对应的算术表达式并存入二叉树中，通过中序遍历二叉树输出表达式及对其进行变量赋值，通过后序遍历二叉树计算表达式的值。(A program is written by prefix expression to construct an arithmetic expression corresponding to it and store it into two binary tree. Through traversing two fork tree out