搜索资源列表
=.=
- 采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Llink-rlink stored using a binary sort tree, the preparation can be established through the keyboard input binary sort tree, and immediately in the establishment of complete traversal o
paixushu
- mfc写的二叉排序树小程序，实现建树，插入，查找，删除，利用树控件显示-mfc binary sort tree to write small programs
erchashu
- 构建一个二叉排序树，使输入的学生信息可以按照成绩从高到低排序，放入顺序表之中，再顺序输出，属于数据结构入门级别的程序-Build a binary sort tree, so that the input information the students can follow the scores from highest to lowest sort, put into the sequence table, and then output in the order, is a data th
C实现二叉树
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
C实现二叉树
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
erchapaixushudekechengsheji
- 二叉排序树的判别的程序设计,代码等一应俱全-Binary Sort Tree of discriminant procedures for design, code, such as self-
paixushu
- 二叉排序树,实现二叉树的排序。可删除结点。-Binary sort tree, binary tree implementation of the sort. Can delete nodes.
malloc
- 在Visual C++中，实现顺序表的顺序查找，链表的顺序查找，折半查找，二叉排序树查找，等。-In Visual C++ in order to achieve the order of the table search, list the order of search, half search, binary sort tree search, and so on.
panduanerchapaixushu
- 这是一个判断二叉排序树的小程序，是软件实验课上自己编的。-This is a binary sort tree to determine small procedures, the software for the experiment of their own class.
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
erchashu
- (1)以回车( \n )为输入结束标志，输入数列L，生成一棵二叉排序树T； (2)对二叉排序树T作中序遍历，输出结果； (3)计算二叉排序树T查找成功的平均查找长度，输出结果； (4)输入元素x，查找二叉排序树T，若存在含x的结点，则删除该结点，并作中序遍历(执行操作2)；否则输出信息“x不存在”； (5) 输入元素x，查找二叉排序树T，若整棵树不存在含值为x的结点，则插入该结点，并作中序遍历(执行操作2)；否则输出信息“x已经存在”。 -(1) to return ( &#
10
- 有关二叉树的程序：判断一颗二叉树是否是二叉排序树！-about something that we learn from class!I did it by myself,and I hope it can help others!Thanks!
Btree
- 二叉排序树又叫二叉查找树，它是一种特殊的二叉树，本程序在VC环境下运行过，简单实用-Binary sort tree is also called the binary search tree, it is a special kind of binary tree, the program is running in the VC environment, the simple and practical
anran
- 非递归的二叉排序树建立与维护，可以实现二叉树的修改、节点删除等-Non-recursive binary sort tree establishment and maintenance, the tree can be modified to delete nodes, etc.
lz_map
- 用二叉排序树实现数据的查找与插入，并且已经实现类的模板化，适合各类数据。-Binary tree used to sort the data to find and insert, and has been achieved kind of template, and suitable for all types of data.
Text10
- 给定如下的一组关键字，建立一棵二叉排序树，插入结点等操作-Given the following set of keywords, the establishment of a binary sort tree, insert-node operation
pengyunhui-4
- 采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Llink-rlink stored using binary sort tree, write through keyboard input the establishment of two binary sort tree, and in the establishment of finished immediately display the results in
homework
- 已知一棵排序二叉树，树中结点的形式为： data info left right 其中，data 给出结点的数据场，info 给出本结点的左子树中的结点总数，left和 right 分别给出本结点的左儿子和右儿子的地址。数据场data 和info的类型皆为 int。又已知该二叉排序树的根结点的地址为 root。请设计二个函数，分别实现下述功能： 1． 按递增序找出该二叉排序树中的第 i 个小的结点。 2． 插入数据场之值为 x 的结点，并仍应保持
BST二叉树的基本操作
- BST二叉排序树的插入、查询、删除、遍历 （中序遍历 从小到大）(The basic operation of the BST two forked tree.Inserting, querying, deleting, traversing two forked sort trees.)
二叉排序树的建立查找插入和删除
- 二叉树的建立，插入，以及排序的完整实现。(The establishment of the two fork tree, insert, sort and complete implementation.)