搜索资源列表
ChonSu
- 已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right n
ForjjWishLin
- 许愿望源码许愿树成长过程树苗树枝叶开发结果-Xu desire to source the Wishing Tree branches leaf seedlings grow up to develop the results of
frog
- 有一条河，左边一个石墩（A区）上有编号为1，2，3，4，…，n的n只青蛙，河中有k个荷叶（C区），还有h个石墩（D区），右边有一个石墩（B区），如图3-1所示。n只青蛙要过河（从左岸石墩A到右岸石墩B）-There is a river, the left side of a stone (A zone) has numbered on 1,2,3,4, ..., n of n only frogs, the river has k-lotus leaf (C zone), also a Shi
hefuman
- 赫夫曼树：试构造一棵有n个叶子结点的二叉树，每个叶子节点带权为wi，则期中带权路径wpl的最小的二叉树-Huffman Tree: test construct an n-leaf nodes are the binary tree, each leaf node with a right to wi, then the period of the right path with the smallest binary tree wpl
leaf
- 用来实现数据结构中求树的叶子结点数目的算法-leaf
erchashu
- 请具体设计一个算法求二叉树叶子节点和高度-Please specify design an algorithm binary tree leaf node and a high demand
2chashu
- 比较全面的二叉树相关操作，先序建立，先、中、后序遍历，计算叶子结点个数，交换左右子树-More complete binary tree related operations, the establishment of the first order, first, during, and after traversing to calculate the number of leaf nodes, the exchange of left and right subtrees
Tree-10-13
- 用C语言创建树结构,对生产的树进行遍历，或按要求查询指定的叶子节点-Tree structure created with the C language, the production tree traversal, or required to query the specified leaf node
BINNODE
- 二叉树的各种操作，包括中序，前序，后序输出，计算树的高度，插入，删除，打印，计算叶子数，delete 二叉树-Binary tree of various operations, including in sequence, before the sequence after sequence output, to calculate the height of the tree, insert, delete, print, calculate leaf number, delete the
erchashu
- 实现二叉树的新建，树深度叶节点的计算，实现二叉树的遍历-Achieve new calculation of the depth of the leaf node in the tree, the binary tree binary tree traversal
hafuman
- 【问题描述】已知输入一串正整数，正整数之间用空格键分开，请建立一个哈夫曼树，以输入的数字为叶节点，求这棵哈夫曼树的带权路径长度。 【输入形式】首先输入正整数的个数，然后接下来为接下来的正整数，正整数个数不超过10个 【输出形式】输出相应的权值 【样例输入】5 4 5 6 7 8 【样例输出】69 -The length of the descr iption of the problem is known to enter a positive integer, a posi
6_5
- 该题是2000年全国青少年信息学奥林匹克的一道试题。叙述如下： 一条小溪尺寸不大，青蛙可以从左岸跳到右岸，在左岸有一石柱L，面积只容得下一只青蛙落脚，同样右岸也有一石柱R，面积也只容得下一只青蛙落脚。有一队青蛙从尺寸上一个比一个小。我们将青蛙从小到大，用1，2，…，n编号。规定初始时这队青蛙只能趴在左岸的石头L上，按编号一个落一个，小的落在大的上面。不允许大的在小的上面。在小溪中有S个石柱，有y片荷叶，规定溪中的柱子上允许一只青蛙落脚，如有多只同样要求按编号一个落一个，大的在下，小的在上，
arc
- 单圆弧叶片造型程序，亲自编写，实测可用。可以以此方法，编写多圆弧叶型程序-The single arc blade modeling program, personally prepared, measured available. Can use this method for the preparation of multi-arc leaf type program
data-structure-experiment
- 数据结构实验：用C++实现二叉树的结点总数、叶子结点个数和深度，能够很好地掌握二叉树及对二叉树进行遍历。-Experimental data structure: it uses C++ to achieve the total number of nodes of the binary tree, the leaf node number and depth, you can master the binary tree and binary tree traversal.
tree
- 数据结构中二叉树的相关问题，求树高，计叶子树等功能-Binary tree data structure, tree height requirements, taking into account leaf tree
Binarytree
- 可以计算二叉树中度为1的结点的个数，二叉树中度数为2的结点的个数，二叉树中叶子结点的个数，二叉树的高度为树的最大宽度，-1 can be calculated binary tree to moderate number of nodes, the binary tree of degree 2 in the number of nodes, leaf nodes of the binary number in the binary tree height of the maximum widt
The-basic-operation-of-a-binary-tree
- 二叉树的基本操作。包括树的（先序、中序、后序）创建、树的遍历（先序、中序、后序）、树的高度、树的宽度、树的叶子节点数-The basic operation of a binary tree. Including tree (first order, in sequence after sequence) created tree traversal (first order, in sequence after sequence), tree height, tree width, tree
gangbantanhuang
- 钢板弹簧拆分的拆分强度计算方法，可以计算钢板弹簧的强度-Calculation method of leaf spring split split strength, can be used to calculate the strength of leaf spring
hdj
- 彩色的正叶线蝴蝶结绘制及其几何变换，如平移旋转等-Butterfly leaf lines are drawn and colored knot geometric transformations, such as rotation, translation
1
- 二叉树的基本操作（1）在二叉链表上设计和实现下列二叉树运算的算法 ① 设计递归算法，实现：删除二叉树，求二叉树的高度，求二叉树中叶子结点数，复制二叉树，交换二叉树的左右子树。 ② 设计算法，按自上到下，自左向右的次序，即按层次遍历一棵二叉树。-The basic operation of a binary tree (1) the design and implementation of the following binary operation on the binary tree algo