Search - binary AND tree

Search - binary AND tree - List

[Windows Develop] 二叉排序树和平衡二叉树计算程序 DL : 0: 二叉排序树和平衡二叉树计算程序。-binary sort tree and balanced binary tree program.
Date : 2008-10-13 Size : 1.53mb User : 马健
[Windows Develop] VC二叉排序树和平衡二叉树计算程序 DL : 0: VC二叉排序树和平衡二叉树计算程序-VC binary sort tree and balanced binary tree program
Date : 2008-10-13 Size : 1.53mb User : 汪大伦
[Windows Develop] datast DL : 0: array.h：安全数组 linkedlist.h：普通表 dclinkedlist：双向循环链表 hashtable.h：哈希表 binstree.h：二叉搜索树 avltree.h： AVL 树如果要存储集合（元素不可重复）并快速查找，最佳的是 binstree.h（二叉搜索树）。如果要存储二维或更高维的表格，最佳的是 hashtable.h（哈系表）。AVL 树的插入成本非常高（删除函数也没有实现），但 AVL 的搜索效率极高，所以适用于在程序开始前初始化程-NOTE: array.h :secure array,linkedlist.h:common table, dclinkedlist:dual cycle linkedlist, hashtable.h:hash table binstree.h:binary search tree, avltree.h: AVL tree, if you want to store set(elements no repeating) and to lookup it swiftly,best is binstree.h(binary search tree).if you want to store two dimensions s or more dimensions s table,best hashtable.h(hash table).the cost of AVL tree s insertion is very high(delete function is not completed),but effiency of AVL tree s search is very high,so it is the same with initialize programme before beginning programme.
Date : 2008-10-13 Size : 16.37kb User : 王飞
[Windows Develop] 二叉排序树和平衡二叉树计算程序 DL : 0: 二叉排序树和平衡二叉树计算程序。-binary sort tree and balanced binary tree program.
Date : 2026-01-01 Size : 1.53mb User : 马健
[Windows Develop] VC二叉排序树和平衡二叉树计算程序 DL : 1: VC二叉排序树和平衡二叉树计算程序-VC binary sort tree and balanced binary tree program
Date : 2026-01-01 Size : 1.53mb User : 汪大伦
[Windows Develop] datast DL : 0: array.h：安全数组 linkedlist.h：普通表 dclinkedlist：双向循环链表 hashtable.h：哈希表 binstree.h：二叉搜索树 avltree.h： AVL 树如果要存储集合（元素不可重复）并快速查找，最佳的是 binstree.h（二叉搜索树）。如果要存储二维或更高维的表格，最佳的是 hashtable.h（哈系表）。AVL 树的插入成本非常高（删除函数也没有实现），但 AVL 的搜索效率极高，所以适用于在程序开始前初始化程-NOTE: array.h :secure array,linkedlist.h:common table, dclinkedlist:dual cycle linkedlist, hashtable.h:hash table binstree.h:binary search tree, avltree.h: AVL tree, if you want to store set(elements no repeating) and to lookup it swiftly,best is binstree.h(binary search tree).if you want to store two dimensions s or more dimensions s table,best hashtable.h(hash table).the cost of AVL tree s insertion is very high(delete function is not completed),but effiency of AVL tree s search is very high,so it is the same with initialize programme before beginning programme.
Date : 2026-01-01 Size : 16kb User : 王飞
[Windows Develop] AVLTreefinal DL : 0: 演示动态平衡二叉树(AVL Tree)的系统.GUI环境,在Windows环境下运行,有二叉树的插入,增加,删除,修改,合并,分裂等功能.-demonstration dynamic binary tree (Tree AVL) system. GUI environment. in the Windows operating environment, a binary tree insertion, add, delete, modify, merge, split, and other functions.
Date : 2026-01-01 Size : 9.99mb User : 有D
[Windows Develop] 6 DL : 0: 二叉排序树撰写一个程序，能够构建字符串型的二叉排序树并在二叉排序树中查找节点。-Binary sort tree to write a program that can build a string of binary sort tree and binary search tree node sort.
Date : 2026-01-01 Size : 1kb User : mumenren
[Windows Develop] lqm_C_Friend DL : 0: C语言写的平衡二叉排序树联系人10个字段信息管理程序。字段采用动态分配。批量导入导出。与 MySQL 兼容，可相互备份，-C language written in a balanced binary sort tree contact 10 fields of information management procedures. Field using dynamic allocation. Batch import and export. Compatible with MySQL can back up each other,
Date : 2026-01-01 Size : 53kb User : 刘QM
[Windows Develop] lqm_C_Friend_AndAppend DL : 0: C语言二叉平衡排序树，10字段联系人信息管理。（与上个相同，只是另附加了掩信息程序）-C language binary sort tree balance, contact information management field 10. (And the last is the same as the other information attached to cover the procedure)
Date : 2026-01-01 Size : 64kb User : 刘QM
[Windows Develop] avl_tree DL : 0: avl树的实现： avl树是每个节点的左子树和右子树的高度最多差1的二叉查找树.一棵高度为h的avl树最少节点数由S(h) = S(h-1)+S(h-2)+1得到.avl树要保证任一节点的左右子树的高度之差的绝对值不能超过1(空树的高定义为1).在插入和删除的时候就需要根据情况对树的某些节点做调整-AVL tree realization: avl tree is left to each node subtree and right subtree height difference up to 1 binary search tree. a height of at least h of AVL tree nodes from S (h) = S (h-1)+ S (h-2)+ 1 received. avl tree to ensure that any one node subtree about the difference between the height of the absolute value of not more than one (empty tree for high-definition 1). in the insertion and deleted when you need according to the circumstances of the tree node to do some adjustments
Date : 2026-01-01 Size : 9kb User : 狼
[Windows Develop] avl DL : 0: avl树的插入删除操作，并包括判断输入的二叉查找树是否为avl树，以及把二叉查找树转换为avl树-AVL tree insertion deletion, and includes judgments entered binary search tree for the AVL tree, and the binary search tree is converted to AVL tree
Date : 2026-01-01 Size : 3kb User : yangfeng
[Windows Develop] binarysearchtree DL : 0: 动态查找表的设计与实现：实现抽象数据类型：二叉查找树。实现下列操作:构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素。-Dynamic Look-Up Table Design and Implementation: To achieve the abstract data types: Binary Search Tree. To achieve the following: Construction empty tables, the destruction of form, specify a keyword search element, insert new elements, delete elements specify a keyword, traverse all the elements of the table.
Date : 2026-01-01 Size : 242kb User : hello
[Windows Develop] bstcnt(1) DL : 0: 二叉搜索树(Binary Search Tree)是满足如下性质的二叉树： ①若它的左子树非空，则左子树上所有结点的值均小于根结点的值； ②若它的右子树非空，则右子树上所有结点的值均大于根结点的值； ③左、右子树本身又各是一棵二叉搜索树。-Binary Search Tree (Binary Search Tree) is to meet the nature of the binary tree as follows: ① If its non-empty left subtree, then the left sub-tree of all nodes is less than the value of the value of root node ② if it the right subtree is not empty, then the right sub-tree of all nodes greater than the value of the value of root node ③ the left and right subtree is the tree itself is the binary search tree.
Date : 2026-01-01 Size : 186kb User : czjy
[Windows Develop] tree DL : 0: 二叉树的构建和遍历和二叉树结点的插入。数据结构的实验。-Binary tree construction and traversal and insertion of binary nodes. Data structure experiment.
Date : 2026-01-01 Size : 1.06mb User : paul lew
[Windows Develop] BiTreeice DL : 0: 二叉排序树的建立，包括先根遍历，后根遍历和层次遍历几种方式-Binary sort tree establishment, including the first traversal the root, dorsal root traversal traverse several ways and at all levels
Date : 2026-01-01 Size : 1.04mb User : Alice
[Windows Develop] exercise DL : 0: （实习题）从键盘上输入一串正整数，最后输入－1作为输入结束的标志。如输入的序列为：2，5，7，23，48，96，……，-1。请以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树。注意：请采用动态存储方法保存这棵二叉排序树，事先并未知道该二叉排序树中的结点的个数。 2、（作业题）已知一棵排序二叉树，树中结点的形式为： data info left right 其中，data 给出结点的数据场，info 给出本结点的左子树中的结点总数，left和 right 分别给出本结点的左儿子和右儿子的地址。数据场data 和info的类型皆为 int。又已知该二叉排序树的根结点的地址为 root。请设计二个函数，分别实现下述功能： 1．按递增序找出该二叉排序树中的第 i 个小的结点。 2．插入数据场之值为 x 的结点，并仍应保持该二叉排序树的性质不变。 3、（作业题）已知一棵二叉排序树，其根结点的地址为 root。请编写一个程序，构造出一棵具有相同结点的完全二叉树，且它同样是二叉排序树。 6/39 4、（选作题）在平衡的排序二叉树的中，试编写删除具有给定关键字的结点的函数。 -(Attachment title) from the keyboard to enter a positive integer, the last input-1 as the input end of the sign. If the input sequence: 2,5,7,23,48,96, ... ...,-1. Please these are integer values as binary sort tree nodes of the value data field, the establishment of a binary sort tree. NOTE: Please save the tree with dynamic storage is binary sort tree, did not know in advance of the binary sort tree, the number of nodes. 2, (working title) is known a sort tree, the tree nodes in the form of: data info left right One, data node given the data field, info is given the left sub-tree nodes in the total number of nodes, left and right nodes are given the left and right son of the son s address. Data field data and the type of info are all int. It is known that the binary sort tree root node s address root. Please design two functions, namely to achieve the following functions: 1. By increasing order to find the binary sort tree nodes i-small. 2. Insert data field of the
Date : 2026-01-01 Size : 755kb User : Lynn
[Windows Develop] tree DL : 0: 实现最简单的二叉树的建立及遍历等基本功能，对树的基本操作有个比较好的了解-To achieve the establishment of the simplest binary tree and traverse the basic functions, the basic operation of the tree have a better understanding of
Date : 2026-01-01 Size : 1kb User : bintang
[Windows Develop] Bst DL : 0: 我们的结课作业。二叉排序树的各种操作，以及二叉排序树的绘制。MFC框架编程，界面友好-Results of our class work. Binary Sort Tree various operations, and the binary sort tree drawing
Date : 2026-01-01 Size : 117kb User : 李哲
[Windows Develop] A-Binary-Search-Tree(BST) DL : 0: PROGRAMMED BY : REHAN AHMED KHAN PAKISTAN- KARACHI BS student in FAST University (foundation for advancement of science and technology) this program is free ware and anyone can use it.
Date : 2026-01-01 Size : 1kb User : ahmadfatemi

« 12 3 4 5 6 »