搜索资源列表
Balanced-Binary-Tree
- 基本实现平衡二叉树的创建,插入和删除操作。使用C++代码实现-Basic balanced binary tree to create and delete operation.
binary-tree-program
- 二叉树是常用的数据结构,本程序式基于二叉树的数据结构C++程序-binary tree program
binary-tree-traversal-traversal--
- 能够对二叉树进行先序、中序和后序遍历,并能在极限值下运行-Can two binary tree preorder, inorder and postorder traversal, and can run in the ultimate value.
binary-tree
- 由中根序列和后根序列重建二叉树,然后以前根顺序输出。-Central root sequence and the sequence of reconstruction after the binary tree root
Chain-binary-tree
- 用VC6.0编写的关于数据结构的链式二叉树算法和代码-About chain binary tree data structure algorithms and code VC6.0 prepared
binary-tree-traversal
- 程序包括二叉树的前序,中序,后序遍历以及特定数据的查找-Program includes former preorder, preorder, after preorder of binary tree traversal and finding specific data. For simple binary tree software curriculum.
the-two-binary-tree-coding
- 使用以下方案为二叉树编码: 空树编码为0 单结点树编码为1 所有m个结点的二叉树编码小于(m+1)个结点的二叉树的编号 若任何m个结点的二叉树,当左右子树为L和R个时的二叉树编号为n,则下列情况下所有m个结点的二叉树,其编号大于n: 左子树的编号大于L 左子树的编号为L,右子树的编号大于R 要求给定一个序数,输出一棵二叉树 -Use the following scheme is binary coded: empty tree coded 0 for singl
the-minimum-cost-of-a-binary-tree
- 在二分检索树中,为了把动态规划应用于得到一颗最优二分检索树的问题,需要把构造这样的一个数看成是一系列决策的结果,而且要能列出求取最优决策序列的递推式,可以帮助你了解最优成本二叉树的实现-In a binary search tree, dynamic programming is applied in order to get the best question a binary search tree, we need to construct a number such as a resul
Linear-binary-tree
- 用类的方法实现线性二叉树。用C++ 实现-Linear binary tree
Binary-tree
- 实现二叉树的叶子结点按从左至右的顺序连成一个单链表-Binary tree leaf nodes in order left to right together into a single list
REBUILD-BINARY-TREE.cpp
- 我们知道如何按照三种深度优先次序来周游一棵二叉树,来得到中根序列、前根序列和后根序列。反过来,如果给定二叉树的中根序列和后根序列,或者给定中根序列和前根序列,可以重建一二叉树。本题输入一棵二叉树的中根序列和后根序列,要求在内存中重建二叉树,最后输出这棵二叉树的前根序列。 用不同的整数来唯一标识二叉树的每一个结点,下面的二叉树 中根序列是9 5 32 67 后根序列9 32 67 5 前根序列5 9 67 32 -We know how to
Binary-Tree
- 数据库结构中实验内容Binary Tree实验源代码,代码比较短-Database structure experiments Binary Tree experiment source code, the code is relatively short
binary-tree
- 由c/c++写的二叉树的常见操作,比如:树的建立、计算树的深度、计算树的叶子节点-Storage and realization of a binary tree
Binary-tree-instant-code
- 给定任意一组(N 个)码长(x1,x2...) ,根据克拉夫特不等式判断是否能够得到二元即时码。如果能,利用二叉树编制二元即时码-According to the Kraft to judge whether it can be coding as a binary instantaneous code. If it does,using binary tree to coding it as a binary instant code.
binary-tree
- Binary tree implementation in C
non-recursive-of-binary-tree
- 二叉树的非递归遍历,运用栈的思想实现二叉树非递归遍历-Non-recursive binary tree traversal, using stacks of thinking non-recursive binary tree traversal
binary-tree
- 1)按照先序序列建立下图所示二叉树的二插链表树,结点元素类型取字符型,树的字符序列从键盘逐个输入。 2)在第1)步建立好的二叉链表树上实施前序、中序和后序递归遍历,并输出相应遍历序列。 3) 在第1) 步建立好的二叉链表树上实施前序遍历的叶子结点输出及其个数统计。 4)在第1)步建立好的二叉链表树上实施中序非递归遍历,并输出相应遍历序列(选做) 5)中序线索化第1)步所建立的二叉链表树,中序遍历所建立的线索二叉树,并输出遍历结果(选做) -1) the establishme
Balanced-binary-tree
- 使用c语言编写程序实现了平衡二叉树的创建功能-Use c language to create a balanced binary tree functions
binary-tree
- 二叉树遍历(Traversal)是指沿着某条搜索路线,依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。-Binary tree Traversal (Traversal) refers to the search along a route, in turn, each node in the tree are one and only for a visit. Operations to do access nodes depends on the spec
Story-editor-binary-tree-traversal
- “文章编辑二叉树遍历各种排序.cpp”、“二叉树的建立以及遍历.cpp”、“各种排序.cpp”、“文章编辑.cpp”- The article edit binary tree traversal various sorting .c++ , build a binary tree traversal and .cpp , various sorting .cpp , Story Editor .cpp