杨弋 讲稿（Yang Yi notes）.docVIP

杨弋 讲稿（Yang Yi notes） Line tree lecture notes Attached middle school of Anhwei Normal University Yang Yi Preface When talking about algorithms, knowledge, and data structures, the line tree is always associated with simple and normal. These characteristics mean that line tree, as a common data structure, has many characteristics, such as common, basic and easy to use. So today Im going to talk about line tree. Definition First, the line segment tree is a tree, and it is a completely two fork tree. At the same time, the word line segment reflects another feature of the line tree: each node represents a line segment, or an interval. In fact, the root node of a line segment tree represents the whole interval, and its left and right subtrees are also a segment tree, representing the left and right halves of the interval. Here, we can give an example to illustrate the usual construction method of line tree, and take RMQ problem as an example: There are N numbers in a row, each asking the minimum number in a paragraph. When constructing, let the root node represent the interval [0, N-1], that is, an interval of all N numbers, then divide the interval into two halves, which are represented by left and right subtrees respectively. It is not difficult to prove that the number of nodes in such a line segment tree is only 2N-1, and it is O (N) level, as shown in fig.: For each node, not only do you have to know the intervals it represents, and its son nodes, but also to record some other values, otherwise, whats the use of a single tree? In this example, as the minimum value of the query is to be made, it is possible to record the minimum in each of the expressed intervals within each node. In this way, the method of constructing a line segment tree according to a linear table is simple: Function constructs subtrees with V as the root There is only one element in the interval represented by if V The minimum value of the V interval is the element, and the construction process is