Textbook Data structure, algorithms, and applications in C++, Sartaj Sahmi 数据结构(用面向对象方法与C++描述),殷人昆等

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

Two kinds of data structure Linear: list, stack, queue, string Non-linear: tree, graph

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

4.1 1D-Array 1. One-dimensional array 1D-array is a limited sequence composed of n (n20) elements which are of the same data type. For example:

2.1 Preface Performance of a program: the amount of computer memory and time needed to run a program We use two approaches to determine it: performance analysis performance measurement

一、斯托克斯(Stokes)公式 二、简单应用 三、环流量与旋度 四、小结

一、曲线积分与路经无关的定义 二、曲线积分与路经无关的条件 三、二元函数的全微分求积 四、小结

一、近似计算 二、计算定积分 三、求数项级数的和 四、欧拉公式 五、小结

一、问题的提出 二、方向导数的定义 三、梯度的概念 四、小结与思考题