搜索资源列表
分形----------------羊齿叶
- 分形--- ----羊齿叶 不错的-reaching back to the good leaf
depth
- 构造二叉树，并求叶子节点的个数和该二叉树的深度。-Construct a binary tree, and find the number of leaf nodes and the binary tree of depth.
VA999
- 是個能夠做附力葉分解動作相當有用的一套程式碼希望能有所幫助-Is a force can do is attached leaf decomposition action of a set of very useful code hope to be helpful
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
leaf
- 用汇编语言实现折半查找算法的运作，是大学汇编语言设计课程的内容，有需要的下载吧-The operation of the binary search algorithm implemented in assembly language, is the the University assembly language design course content, there is a need to download
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
ER
- 二叉树的先序中序后序递归以及非递归遍历，二叉树的叶子节点等功能-Preorder in sequence after sequence of recursive and non-recursive traversal of a binary tree, the binary tree leaf nodes and other functions