搜索资源列表
TreeViewListView
- 描述了treeview 和listview的基本功能（添加新节点，展开树，以及删除节点等操作），同时点击节点时可以在listview中显示相关信息-Treeview and listview described the basic functions (add a new node, expand the tree, and delete nodes and other operations), and click the node can display information in the
BinaryTree
- 数据结构经典实例，深入了解二叉树。如：可查询每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-Classic examples of data structures, in-depth understanding of binary tree. Such as: to check the level of each node, the node from the root to shoot length (path length)
erchashu
- 请具体设计一个算法求二叉树叶子节点和高度-Please specify design an algorithm binary tree leaf node and a high demand
tree
- windows下实现树的部分操作：插入节点，删除节点-windows to achieve the tree part of the operation: insert node, delete node, etc.
balancebinarytree
- 平衡二叉树，功能包括插入删除节点，保持平衡性-Balanced binary tree, features include insert and delete nodes, to maintain balance
44441
- 利用数据结构的知识生成一颗哈弗曼树，实现遍历数的节点，输出所要的节点信息-Data structures generated using a Havermann tree of knowledge, to achieve the number of nodes traversed, the output of the node information to be
panhong1
- 建立二叉树，并求树的节点总数，求树的节点总数，求一颗二叉树的宽度等！-Build a binary tree, and the total number of demand nodes in the tree, find the total number of nodes in the tree, find the width of a binary tree!
bintree
- 对一个二叉树进行各种运算，包括获取节点的子树节点数，节点层数，节点子树的最大值等等。-Various operations on a binary tree, including access to the sub-tree nodes in the node, the node number of layers, so the maximum value of the node subtree.
btoflandno
- 功能为能够求出给定的二叉树的高度和二叉树的节点的个数，比较简单-To give your thar the length of the binary tree and the number of the node of the binary tree
bitree
- 二叉树的建立与遍历，以及求二叉树的叶子节点数，节点数，树的深度等。并用主函数调用各个子函数，功能非常全。建立二叉树的原理是先把二叉树看成完全二叉树，然后对各节点编号，利用二叉树的性质建立二叉树。-Establishment of the binary tree traversal, and the demand nodes in binary tree leaves, nodes, depth of the tree. With the main function calls each sub
btree
- 对二叉树进行各种操作，包括建立，求深度，求节点个数和叶子节点个数，用括号表示法表示二叉树，查找指定节点的左右孩子，销毁二叉树-Various operations on the binary tree, including the establishment, seeking the depth of demand node number and leaf node number, said binary notation with parentheses, to find about the
binarytree
- 输入二叉树的前序排列以及中序排列，对二叉树进行遍历，并计算二叉树叶子节点总数以及树的深度。-Input binary tree arrangement of the first order and arrangement in the sequence of binary tree traversal, and calculate the total number of binary tree leaf nodes and tree depth.
TreeView
- 树控件，自动添加根节点和子节点。类似于资源管理器 -Tree control, automatically adds the root node and child nodes. Similar to the Explorer
3GPFileDecoder
- 用于查看3gp mov mp4 文件格式框架. 新增了结构树浏览, 双击左侧树的节点可以显示当前的节点内部结构. 支持文件格式3g2 3gp, mov, mp4 等符合3gpp的文件。-Used to view 3gp mov mp4 file format framework. Add the tree view, double-click the left side of the tree node to show the internal structure of the curre
tree
- 用于对二叉树的判定，建立二叉树，查找左右节点等-Used to determine the binary tree, build tree, look around nodes, etc.
Exercise2
- 1、（实习题） 请编写一个程序，确定二叉树的特征。如：每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-1, (practice questions) Write a program to determine the characteristics of a binary tree. Such as: the level of each node, the node from the root to shoot length (
lab2
- 利用广义表建立的二叉树，将碱基作为他的节点，实现了以树形输出，并且交换了左右子树，利用非递归中序遍历和先序遍历。-The establishment of the binary tree using the generalized form, the base node as he realized to the output tree, and the exchange of left and right sub-tree in the use of non-recursive travers
MutiTree-santaishu
- 树控件节点的三种状态，节点前有复选框，可设置其状态。-Three tree control node status, node before check box, and can set its state.
k
- 双亲表示法实现二叉树，用链表实现，和堆栈，能更好的找到根节点-Parents to achieve binary notation, with the linked list implementation, and the stack, can find a better root
multi_file_op_bitree
- 一个很好的二叉树的程序，可以在vc++6.0环境下执行，可以创建，先序，中序，后序遍历，还可以输出树的叶子节点，按树状打印该二叉树-A good binary tree program, you can run under vc++6.0, you can create, the first order, in order, after traversing, you can output the tree leaf node, print the binary tree by tree