搜索资源列表
ch06
- 我們的注意焦點要轉到搜尋樹（search tree）了，要深度討論兩種標準的樹結構（tree structure），就是本章所要說明的二元搜尋樹（binary search tree）以及下一章所要討論的 AVL 平衡樹（AVL tree）。這兩種樹其資料都依序排列的，它們之間的差別只在於 AVL 是一種平衡樹，而二元搜尋樹卻不是。-We want to focus the attention of the search tree (search tree), and want to discu
ch07
- 二元搜尋樹簡單易懂，不過有一個問題：它並非平衡樹。本章將介紹平衡的 AVL 搜尋樹，討論它的資料結構、函式，並設計程式使用它。 -Simple binary search tree, but there is a problem: it is not a balanced tree. This chapter will introduce a balanced AVL search tree, to discuss its information structure, function, and
BSTREEE
- binary search tree is umplemented using data structures in C-binary search tree is umplemented using data structures in C++
search
- 利用顺序表作为查找表，创建一查找表，编程实现顺序查找算法及二分法查找算法，并对其进行验证。顺序表中的顺序查找算法的实现-The use of the order of the table as a look-up table, create a look-up table, programming sequential search algorithm and binary search algorithms, and validate them. The order of the order
BinarySearch
- 二分法查找程序课程设计，只供大家参考，不要直接复制粘贴，还是以学习为主。-Binary search program curriculum design
insertionsort+binarysearch
- This a program code on VB, that realize a insertionsort and binary search-This is a program code on VB, that realize a insertionsort and binary search
BinarySearchTree
- A binary search tree is a binary tree that is either empty or in which each node contains a key that satisfies the following conditions: 1) All keys (if any) in the left subtree of the root precede (are less than or equal to) the key of the
SE
- the file contains various issues regarding computer science such as linked lists,binary search trees etc-the file contains various issues regarding computer science such as linked lists,binary search trees etc..
CLC_K53
- BSTree Binary Search tr-BSTree Binary Search tree
ArboreBinarCautare
- Binary search tree. A simple binary search tree, implemented as an object-oriented, recursive data structure in Java, for objects that extend Comparable.
CORDIC-For-Dummies
- CORDIC For Dummies CORDIC is a method of calculating a math function using much simpler math operations in a loop called a Binary Search. Most commonly CORDIC is used to calculate ATAN2 (Angle), and Hypotenuse (Distance) of a point. CORDIC c
sxj2
- 罢市五个数由大到小的顺序存放到一个数组中，输入一个数，要求用折半查找法找出该数是数组中第几个元素的值。如果该数不在数组中，则打印出无此数。-Strike descending order of five numbers stored in an array, enter a number, the binary search method to find out the number of several elements in the array values. If the number i
BST
- Binary Search Tr-Binary Search Treeeee
susheguliruanjian
- 宿舍管理查询软件（限2 人完成） 1)任务：为宿舍管理人员编写一个宿舍管理查询软件, 程序设计要求： A.采用交互工作方式 B.建立数据文件，数据文件按关键字（姓名、学号、房号）进行排序(冒泡、选择、插入排序等任选一种) 2)查询菜单: (用二分查找实现以下操作) A.按姓名查询 B.按学号查询 C.按房号查询 3)打印任一查询结果（可以连续操作）-Dormitory management query software (limited to two peop
Editoragain11
- 1.了解查找和排序的基本概念 2.熟练掌握顺序查找和二分查找算法 3.熟练掌握直接插入排序算法 二、重点与难点 1.重点：二分查找算法 2.难点：直接插入排序算法 三、教学过程的具体安排 1.本次实验的内容如下： 实验利用C语言实现数据结构课程中相关的查找算法和 -1 understand the search and sort the basic concepts 2. Mastered sequential search and binary search
7.Binary-Search-Tree
- 二叉树收索，包括二叉树的遍历，收索，增加，删除等功能-Close binary search
binary-search-algorithm(CPP)
- 输入一个数，在已知数组中查找该数的位置，输入的数不存在数组中。-Enter a number in the array to find the number of known positions, the number entered does not exist in the array.
BST-Code
- Binary Search Tree Code
1
- 对记录序列（查找表）：{55，13，23，72，109，67，2，78,13}分别实现如下操作： 1) 顺序查找； 3) 对排好序的纪录序列表进行折半查找； 4) 利用1）中记录序列建立一颗二叉排序树，并在其上实现特定关键字值结点的查找； 5) 按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表； 6) 实现5）创建哈希表上的查找 -On the record sequence (lookup table): {} 55,13,23,7
Binary-search-tree-and-file-
- 进行二叉搜索树和文件操作的头文件binSearchTreeF.h,行二叉搜索树和文件操作的实现文件binSearchTreeF.c-Binary search tree and file operations