搜索资源列表
depth
- 构造二叉树，并求叶子节点的个数和该二叉树的深度。-Construct a binary tree, and find the number of leaf nodes and the binary tree of depth.
erchashu
- 使用中序遍历，先序遍历，后序遍历，交换左右子树，计算结点数，计算树的高度-Use traversal first traversal, after traversal exchange about subtree, computing nodes, computing the height of the tree
binarytree
- 二叉树的操作，程序采用递归可进行树的遍历，求叶子节点的个数，交换左右子树等操作-Binary operation, the procedure can be carried out using recursive tree traversal, and the number of leaf nodes, exchange and other operations around subtree
Cpp1
- 二叉树的链式存储,以及使用链式存储统计叶子结点个数-Binary tree chain store, chain store statistics and the use of the number of leaf nodes
hafuman
- 哈夫曼编码为实现哈夫曼编码，先构造哈夫曼树。哈夫曼树的每个节点都存有该节点的信源符号，概率，双亲节点，左孩子节点和右孩子节点。每个节点的概率为该节点左孩子节点和右孩子节点的概率之和。每次选取概率最小的两个节点作为左右孩子节点，直到把所有的数据都整合到哈夫曼树中。每个原始数据都处于叶子节点的位置。-Huffman coding Huffman coding to achieve the first Huffman tree structure. Huffman tree for each node
CPP-
- 求图两节点的所有最短路径的程序 ,适应用于找两点间的最短距离-Find the shortest path of two nodes in the procedures of all
HuffmanTree
- 根据哈夫曼算法，建立哈夫曼树时，可以将哈夫曼树定义为一个结构型的一维数组HuffTree，保存哈夫曼树中各结点的信息，每个结点包括：权值、左孩子、右孩子、双亲-Huffman algorithm Huffman tree is created, the Huffman tree is defined as a structure of one-dimensional array HuffTree, save the information of Huffman tree nodes, each
BiTree
- 建立一棵含有n个结点的二叉树，采用二叉链表存储, 前序（或中序、后序）遍历该二叉树。 -Create a binary tree with n nodes, using a binary linked list storage, pre-order (or sequence order) traversal of the binary tree.
three-node-model
- opnet网络仿真 三个节点基础模型 是最简单-opnet network simulation based model of three nodes is the most simple
counter
- 输入若干个正整数（输入-1为结束标志），并建立一个单向链表，将其中的偶数值结点删除后输出。 -Enter the number of positive integers (enter-1 marks the end), and the establishment of a singly linked list, which even numerical nodes removed output.
include
- 线索二叉树 建立中序线索二叉树，并且中序遍历 求中序线索二叉树上已知结点中序的前驱和后继-Binary tree in order to establish clues clues tree, and in the traversal sequence for clues in the binary tree nodes on the known sequence of the precursor and follow-up
vbdatabase
- 为树状浏览器控件添加节点和子节点 用ADD方法添加一个新节点到树状浏览器的NODES集合时，可以声明它是和已存在的节点所联系起来的。通常使用ADD方法，-Add nodes and sub-nodes with ADD method to add a new node to the tree browser NODES collection tree browser controls can be declared and existing nodes linked. Usual
-binary-tree
- 本文介绍了二叉树的定义、性质及存储方式，各种遍历算法。 以及求所有叶子及结点总数。-This article describes the definition, nature and storage of binary tree, various traversal algorithm. And the demand of all the leaves and the total number of nodes.
littleworld
- NW小世界网络的构成原则为：从一个环状的规则网络开始，网络含有N个结点，每个结点向与它最近邻的K个结点连出K条边，并满足N>>K>>In(N)>>1。随后进行随机化加边，以概率p在随机选取的一对节点之间加上一条边。其中，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时，NW小世界模型本质上等同于WS小世界模型。 -NW constitu
listDelete
- 链表节点删除。链表的构建节点的删除。单链表。-List nodes removed. Linked list building node removal.
Degree_Distribution
- 计算ER网络的节点的度和节点度分布,改进了随机生成邻接矩阵的生成。-Computing degree ER network nodes and node degree distribution, improving the adjacency matrix generate randomly generated.
2_1
- 逆转链表 设有一个表头指针为h的单链表。试设计一个算法，通过遍历一趟链表，将链表中所有结点的链接方向逆转。要求逆转结果链表的表头指针h指向原链表的最后一个结点-Reversal table pointer list with a single list of h. Try to design an algorithm to traverse a trip through the list, the list of all nodes linked direction reversal. Re
3_1
- 若用二叉链表作为二叉树的存储表示，试针对以下问题编写递归算法： 统计二叉树中叶结点的个数。 -If using the binary tree as a binary tree stores that try to prepare for the following recursive algorithm: Statistics mid-binary number of nodes.
tree
- 树的相关操作，先序遍历建立二叉链表，左右孩子交换，二叉树中叶子节点个数算法，统计以值为x的结点为根的子树中叶子结点的数目，按树状打印二叉树-Tree-related operations, first traversal establishment of binary list, so the child exchange, the number of leaf nodes in a binary tree algorithm, the statistical value of x to a n
33-nodes-trend-technology-program
- 33节点潮流计算 毕业设计论文中可能会用到 总之很牛逼就对了-33 nodes trend technology program