搜索资源列表
BinaryTree
- Build search Binary tree
tree
- 对二叉搜索树的C#实现，有增，搜，删的功能-Binary search tree of the C# to achieve, there are increasing found, delete function
Code
- C#常用的算法资料，另外，里面还包含C#基本的数据结构和一些常用的类的使用，冒泡法，二叉树等等常用的结构。-Algorithm commonly used in C# information, the other, which also includes C# basic data structure and a number of commonly used type of use, bubble method, commonly used binary tree structure and
tree
- 平衡二叉树：插入结点 在平衡二叉排序树BBST上插入一个新数据元素e 删除结点 删除结点过程与插入结点的操作类似，基本过程是：平衡二叉树，找到要删除的结点，删除一个结点，变成二叉树，旋转，变回平衡二叉树。 查找 把给定值与根结点作比较,若给定值大于根结点则查找其右子树,小于则查找其左子树,如此类推。 -Insertion node in the balanced binary sort tree BBST insert a new data element e remov
2-3-tree
- Example of implementation of 2-3 tree binary tree. This is code available for freely distribution
binary-tree
- 建立了一个二叉树，写出二叉树的结点，然后用前序历遍、中序历遍、后序历遍来访问了整棵二叉树。-A binary tree, write a binary tree node, and then use the pre-order the calendar over the calendar times in sequence, after the sequence to access the calendar over the whole grain binary tree.
copy-tree
- 用c语言进行简单的二叉树复制，但是实用性不大-C language simple binary tree replication
Traversing-Binary-Tree
- 二叉树遍历，简历二叉树实现先序遍历，中序遍历，后序遍历。-Traversing Binary Tree
binary-treedepth
- 这是一个简单的关于求二叉树的深度的小程序。-This is a simple program about binary tree depth.
Binary-Tree
- 1、输入“扩展先序遍历序列” 创建二叉链表并中序遍历输出之 2、求树高 -1, enter " extended the first traversal sequence" create binary list inorder traversal output of 2, find a tree height
red-tree
- 红黑树 二叉树 性能比较分析 红黑树 二叉树-Red-black tree binary tree performance analysis,
Binary-Tree
- 关于二叉树的一些基本操作：创建、遍历、结点数、高度、交换左右孩子、等等。-Some basic operations on binary tree: Create, traverse, nodes, height, exchange or so kids, and so on.
binary-tree-traversal-traversal--
- 能够对二叉树进行先序、中序和后序遍历，并能在极限值下运行-Can two binary tree preorder, inorder and postorder traversal, and can run in the ultimate value.
tree
- 判断两个序列是否为一个二叉树序列，如果序列相同则输出YES，否则输出NO-Determine whether two sequences as a sequence of binary tree, YES, if the same sequence output or output NO
birprate-tree
- 二叉树构建及遍历方式，深度宽度，叶子节点，顶点数，等各种计算-Binary Tree Construction and traversal, depth width, leaf node, the number of vertices, and other computing
Binary-Tree
- Binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of containers: data structures that store items (such as numbers, names etc.) in memory.-Binary search trees (BST), sometimes called ordered or sorted b
Binary-Search-Tree
- 实现了二叉查找树的各种操作：插入结点、构造二叉树、删除结点、查找、 查找最大值、查找最小值、查找指定结点的前驱和后继-Achieve a binary search tree of various operations: Insert node binary tree structure, delete nodes, find, find maximum, find minimum, look for the specified node predecessor and successor
tree
- 二叉树树是一种重要的非线性数据结构，直观地看，它是数据元素（在树中称为结点）按分支关系组织起来的结构，很象自然界中的树那样。树结构在客观世界中广泛存在，如人类社会的族谱和各种社会组织机构都可用树形象表示。树在计算机领域中也得到广泛应用，如在编译源程序如下时，可用树表示源源程序如下的语法结构。又如在数据库系统中，树型结构也是信息的重要组织形式之一。一切具有层次关系的问题都可用树来描述。满二叉树，完全二叉树，排序二叉树。中序遍历，先序遍历，后序遍历-Binary tree is an importa
tree
- MFC 实现树，数据结构的课程设计实现树-MFC realize tree, the data structure course design, realization of binary tree
Binary-tree
- 输入先序数列和中序数列得出后序数列并打印二叉树-Enter the order of precedence and the order of the sequence of the order of the second series and print binary tree