西安建筑科技大学：《数据结构基础》课程课堂笔记_第六部分 图结构_图 Graph（英文）

Definition of search Static search table Dynamic search table Hash table

const int maxLen = 128; class String { int curLen; //串的当前长度 char *ch; //串的存储数组 public: String ( const String& ob ); String ( const char * init );

G( V, E ) where G ::= graph, V = V( G ) ::= finite nonempty set of vertices, and E = E( G ) ::= finite set of edges

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

天津大学：《数据结构 Data Structures》课程PPT教学课件（英文版）CHAPTER 8 THE DISJOINT SET ADT

西安建筑科技大学：《数据结构基础》课程课堂笔记_第五部分 树结构_二叉树 BINAR Y TREES（英文）

3.1 Definition of data structure 3.2 Stacks 3.3 Queues 3.4 Linked lists 3.5 Trees 3.6 Postfix expression 3.7 Infix to postfix conversion

5.1 Dictionary problem 5.2 Hash functions 5.3 Collisions resolution by chaining 5.4 Open addressing 5.5 Probing strategies: linear, quadratic, and double hashing 5.6 Analysis of open addressing

7.1 Introduction to amortized analysis 7.2 Aggregate method 7.3 Accounting method 7.4 Potential method 7.5 Dynamic tables