Search - binary AND tree

Search - binary AND tree - List

[CSharp] 二叉排序树及其查找 DL : 0: 数据结构上机二叉排序树及其查找,包含更新二叉排序树存储二叉排序树上的查找,二叉排序树上的插入,二叉排序树上的删除等-data structure two forks on the plane and you sort tree, update contains two fork-tree storage binary search tree by sequencing, two tree fork insertion sort, two fork of the tree sort delete
Date : 2008-10-13 Size : 1.4kb User : 大阳
[CSharp] 030300726_2 DL : 0: 用vc实现二叉树的各种排列。输入一颗二叉树后输出以前序后序中序排列的各节点和这棵树的高度-vc achieve binary tree with the various permutations. After the importation of a binary tree before output sequence after sequence with the order of the nodes and tree height
Date : 2008-10-13 Size : 1.35kb User : 林天
[CSharp] 030300726_2 DL : 0: 用vc实现二叉树的各种排列。输入一颗二叉树后输出以前序后序中序排列的各节点和这棵树的高度-vc achieve binary tree with the various permutations. After the importation of a binary tree before output sequence after sequence with the order of the nodes and tree height
Date : 2026-01-01 Size : 1kb User : 林天
[CSharp] 二叉排序树及其查找 DL : 0: 数据结构上机二叉排序树及其查找,包含更新二叉排序树存储二叉排序树上的查找,二叉排序树上的插入,二叉排序树上的删除等-data structure two forks on the plane and you sort tree, update contains two fork-tree storage binary search tree by sequencing, two tree fork insertion sort, two fork of the tree sort delete
Date : 2026-01-01 Size : 1kb User : 大阳
[CSharp] pinghen DL : 0: 平衡二叉树，又称为AVL树，是1962年由Adelsonr Velskii 和Landis 提出并以他们的名字命名的，它是具有如下性质的二叉树：-balanced binary tree, also known as AVL tree, yes in 1962 by Adelsonr Velskii and Landis made and named after them , it is the nature of the binary tree is as follows :
Date : 2026-01-01 Size : 171kb User : 王彬
[CSharp] Code DL : 0: 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 so on.
Date : 2026-01-01 Size : 39kb User : Grove.Chu
[CSharp] tree DL : 0: 平衡二叉树：插入结点在平衡二叉排序树BBST上插入一个新数据元素e 删除结点删除结点过程与插入结点的操作类似，基本过程是：平衡二叉树，找到要删除的结点，删除一个结点，变成二叉树，旋转，变回平衡二叉树。查找把给定值与根结点作比较,若给定值大于根结点则查找其右子树,小于则查找其左子树,如此类推。 -Insertion node in the balanced binary sort tree BBST insert a new data element e removed nodes removed node insertion process and the operation of similar nodes, the basic process is: a balanced binary tree, find the node you want to delete, delete a nodes, into a binary tree, rotation, turned back into a balanced binary tree. Find the given value to compare with the root node, if the value is greater than a given root node to find its right subtree is less than the search for its left subtree, and so on.
Date : 2026-01-01 Size : 42kb User : youyu
[CSharp] binarytree DL : 0: 输入二叉树的前序排列以及中序排列，对二叉树进行遍历，并计算二叉树叶子节点总数以及树的深度。-Input binary tree arrangement of the first order and arrangement in the sequence of binary tree traversal, and calculate the total number of binary tree leaf nodes and tree depth.
Date : 2026-01-01 Size : 1kb User : 刚玉
[CSharp] binary-tree DL : 0: 建立了一个二叉树，写出二叉树的结点，然后用前序历遍、中序历遍、后序历遍来访问了整棵二叉树。-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.
Date : 2026-01-01 Size : 1kb User : 徐茂威
[CSharp] bianry-sort-tree DL : 0: 设计了算法，将n个数据组成二叉排序树结构，并可以删除其中的一个结点。输入：数据个数n、n个数据、需要删除的数值value。输出：原始数据、二叉排序树的中序输出及删除结点value后的结果。-Designed the algorithm, the data consisting of n binary sort tree structure, and you can remove one node. Input: the number of data n, n data, you need to delete the value value. Output: raw data, binary sort tree inorder output node value and delete the results.
Date : 2026-01-01 Size : 1kb User : YY
[CSharp] Binary-Tree DL : 0: 关于二叉树的一些基本操作：创建、遍历、结点数、高度、交换左右孩子、等等。-Some basic operations on binary tree: Create, traverse, nodes, height, exchange or so kids, and so on.
Date : 2026-01-01 Size : 257kb User : 胡孝磊
[CSharp] binary-tree-traversal-traversal-- DL : 0: 能够对二叉树进行先序、中序和后序遍历，并能在极限值下运行-Can two binary tree preorder, inorder and postorder traversal, and can run in the ultimate value.
Date : 2026-01-01 Size : 216kb User : 李世成
[CSharp] tree DL : 0: 二叉排序树的查找、插入、删除、建立算法的思想及程序实现-Find a binary sort tree, insert, delete, create ideas and programs to achieve the algorithm
Date : 2026-01-01 Size : 1kb User : 徐小敏
[CSharp] birprate-tree DL : 0: 二叉树构建及遍历方式，深度宽度，叶子节点，顶点数，等各种计算-Binary Tree Construction and traversal, depth width, leaf node, the number of vertices, and other computing
Date : 2026-01-01 Size : 2kb User : 叶良辰
[CSharp] BinarySearchHeapConstruction DL : 0: Binary Search Heap Construction-Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes have each assigned a priority (a number) such that the priority of each internal node is less than the priority of its parent. As a consequence, the root has the greatest priority in the tree, which is one of the reasons why heaps can be used for the implementation of priority queues and for sorting. A binary tree in which each internal node has both a label and a priority, and which is both a binary search tree with respect to the labels and a heap with respect to the priorities, is called a treap. Your task is, given a set of label-priority-pairs, with unique labels and unique priorities, to construct a treap containing this data.
Date : 2026-01-01 Size : 1kb User : 刘辉
[CSharp] Binary-Search-Tree DL : 0: 实现了二叉查找树的各种操作：插入结点、构造二叉树、删除结点、查找、查找最大值、查找最小值、查找指定结点的前驱和后继-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
Date : 2026-01-01 Size : 4.37mb User : scarlett
[CSharp] tree DL : 0: 二叉树树是一种重要的非线性数据结构，直观地看，它是数据元素（在树中称为结点）按分支关系组织起来的结构，很象自然界中的树那样。树结构在客观世界中广泛存在，如人类社会的族谱和各种社会组织机构都可用树形象表示。树在计算机领域中也得到广泛应用，如在编译源程序如下时，可用树表示源源程序如下的语法结构。又如在数据库系统中，树型结构也是信息的重要组织形式之一。一切具有层次关系的问题都可用树来描述。满二叉树，完全二叉树，排序二叉树。中序遍历，先序遍历，后序遍历-Binary tree is an important non-linear data structures Intuitively, it is a data element (called a node in the tree) structure by branch relations organized, much like the nature of the tree that. Tree widespread in the objective world, such as genealogy and various social organizations of human society are available tree image representation. Tree in the computer field has also been widely used, such as when compiling source code, is available indicates that the syntax tree structure of the source following the source. Another example is in the system, the tree structure is also an important organizational form of information. All issues are available in a hierarchy tree to describe. Full binary tree, complete binary tree, binary tree sort. Preorder, preorder, after preorder
Date : 2026-01-01 Size : 175kb User : 陈泉秀
[CSharp] DS_EX4 DL : 0: 分别基于线性表、二叉排序树或哈希表不同的检索策略，实现一个列车信息检索系统（列车信息保存在train.txt中），能根据输入的“车次”检索出对应的列车详细信息，并计算不同检索策略的平均查找长度ASL。-Respectively, based on the linear table, binary sort tree or hash table different search strategies to achieve a train Information Retri System (train information stored in train.txt), corresponding to the train details can be entered in accordance with the " trips" search, and calculate the different search strategies of the average length of ASL.
Date : 2026-01-01 Size : 21kb User : peter
[CSharp] Binary-tree DL : 0: 输入先序数列和中序数列得出后序数列并打印二叉树-Enter the order of precedence and the order of the sequence of the order of the second series and print binary tree
Date : 2026-01-01 Size : 2kb User : 宋
[CSharp] Binary-Trees-(ABB) DL : 0: In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a triple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set.Some authors allow the binary tree to be the empty set as well. This is a Visual Studio C# proyect that allows you tou simulate this types of trees.
Date : 2026-01-01 Size : 356kb User : Lillith

« 12 3 4 »