搜索资源列表
BiTree
- 输入一个字符串，并建成一棵二叉树，满足左子树的字符都要小于根结点的字符，右字树的字符都要大于根结点的字符，每个结点值有字符和字符的出现次数，并用三种遍历方法打印，比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。-Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the
leaf
- 这是一篇计算叶子总总量的论文，非常好的参考资料；-how to weight leaf
erchashu-
- C语言实现二叉树的创建 及先序、后序、层序遍历，输出树的深度，每一层节点个数，叶子总数-Creation and the first sequence of binary tree in C language, the order of the sequence traversal, output the depth of the tree, each layer the number of nodes, leaves the total number of
5
- 二叉树的三种遍历，求深度、叶子，按层次遍历，-Binary tree traversal, and depth leaves hierarchy traversal
Huffman
- 哈弗曼编码 利用二叉树来设计二进制的前缀编码，从根结点到叶子结点的路径上分支字符组成的字符串作为该叶子结点字符的编码。-huffman coding
c-cpp
- (1) 实现二叉树先序遍历、中序遍历、后序遍历等运算。 (2) 实现计算二叉树叶子结点和交换二叉树中所有结点左右子树的运算 -(1) binary tree preorder, preorder, postorder traversal operations. (2) calculated to achieve binary tree leaf node and all nodes exchange binary sub-tree operations around