数据结构A文库下载_中国高校课件下载中心

文档格式：PPT　文档大小：363KB　文档页数：80

11.1 Binary Search Trees 1.Definition: A binary search tree is a binary tree that may be empty. nonempty binary search tree satisfies the following properties: 1)Every element has a key and no two elements have the same key: therefore,all keys are distinct

《数据结构的算法在C++中的应用》（英文版）Chapter 6 Queue

文档格式：PPT　文档大小：120.5KB　文档页数：30

6.1 Definition Definition: A queue is a linear list in which additions and deletions take place at different ends. It is also called a first-in-first-out list. The end at which new elements are added is called the rear. The end from which old elements are deleted is called the front

《数据结构的算法在C++中的应用》（英文版）Chapter 5 Stack

文档格式：PPT　文档大小：114.5KB　文档页数：23

5.1 definition of stack Definition A stack is a linear list in which insertions and deletions take place at the same end. This end is called the top. The other end of the list is called the bottom. It is also called a LIFO(last-in-first-out) list

清华大学：《数据结构》课程电子教案（PPT课件讲稿）Chapter9 String

文档格式：PPT　文档大小：183KB　文档页数：17

string is composed ofn(20) characters in an orderly sequence recorded as s:“c1C2C3…Cn” S is string name c123n is value is a character n is string length Such as,S=“ TSinghua University

《数据结构》课程教学资源：第五章树形结构（1/2）

文档格式：PPT　文档大小：333KB　文档页数：94

非递归定义树结构是二元组(D,R),其中,D是n个数据元素的有穷集合(n>0)(数据元素称为结点),R是D上的一个关系。n=0时,称为空树;否则它满足以下条件: a)有且仅有一个结点d∈D,满足:不存在任何d∈D, 使

浙江大学：《数据结构与算法》第四章（4-1）串类型的定义

文档格式：PPT　文档大小：107.5KB　文档页数：25

非数值处理的对象基本上是字符串数据串( string)(或称字符串) 由零个或多个字符组成的有限序列记为:s=a1a2an’(n>=0) a;1(1<=i<=n)是字母,数字或其它字符 n称为串的长度,n=0的串称为空串( Null string) 子串一—串中任意个连续字符组成的子序列包含子串的串叫主串

《数据结构》课程教学资源：第四章数组和广义表

文档格式：PPT　文档大小：168.5KB　文档页数：5

4.1数组的顺序存储结构 4.1.1数组的定义几乎在所有的高级算法语言中,都有数组类型数据的定义数组是线性表的推广,本节仅以二维数组为例,给出数组的定义左式是大家所熟悉的矩阵,即二维数组 a1an2n一个二维数组的逻辑结构可形式地表为:

广东海洋大学：《C++程序设计》第一章练习题

文档格式：PPT　文档大小：61.5KB　文档页数：4

一、选择题 1.最初的计算机编程语言是a a机器语言b汇编语言 c高级语言d.低级语言 2.程序应该必须包含的部分是d a头文件b注释 c.高级语言d.数据结构和算法

清华大学：《数据结构》课程电子教案（PPT课件讲稿）Chapter8 Sorting

文档格式：PPT　文档大小：2.35MB　文档页数：75

Sorting: There is a series of data in random order, we sort them depending a certain key word Datalist: an finity set of data waiting to be sorted Key: data object has many attribute areas, namely there are many data element, one of all these elements can be used to distinguish object, we use it as sorting key. we also call it sorting code

清华大学：《数据结构》课程电子教案（PPT课件讲稿）Chapter4 Stacks Queues

文档格式：PPT　文档大小：1.53MB　文档页数：70

CHAPTER 4 Stacks and Queues SI The stack adt 1. ADT A stack is a Last-In-First-Out(LIFO)list, that is. an ordered list in which insertions and deletions are made at the top only Objects: A finite ordered list with zero or more elements

首页上页 4 5 678 9 10 11 下页末页

搜索一下，找到相关课件或文库资源 137 个