cp A common routine (also the core solution to the generalized line segment tree problem, UNR1 seems to have a problem): If an interval is modified on the line segment tree, it must be a right node + a left node This process is actually the essence of zkw The following will be understood using […]

# Tag: tree

## Couleur (chairman tree + heuristic splitting)

I learned dsu on tree a long time ago, but I didn’t expect heuristic splitting Couleur Question meaning: Given a sequence, one operation can invalidate one position. Given the sequence of operations (hidden through XOR, forced online), find the maximum number of reverse sequences in the continuous sub-interval without invalid positions after each operation. Each […]

## Transmission line fault diagnosis (Python code, five different diagnosis methods: logistic regression, decision tree, random forest, XGBoost and support vector machine)

Effect video: Transmission line fault diagnosis (Python code, five different diagnosis methods of logistic regression, decision tree, random forest, XGBoost and support vector machine)_bilibili_bilibili project files code.py loads the English version, with English labels and coordinates displayed on the picture. Chinese.py loads the Chinese version, with Chinese labels displayed on the picture, etc., and almost […]

## [Data structure] Implementation of binary tree chain structure (3)

Table of Contents 1. Chain structure of binary tree 2. Interface implementation of binary chain 1. Creation of binary chain 2. Interface function 3. Dynamically create new nodes 4. Create a binary tree 5. Preorder traversal 6. In-order traversal 7. Post-order traversal Third, the number and height of nodes, etc. 1. Interface function 2. Number […]

## Encapsulation of map and set containers based on red-black trees

Code gitee repository for this chapter: map and set simulation implementation, stl_map_set_tree source code Article directory 1. Generics of red-black trees 1.1 Red-black tree node 1.2 Red-black tree iterator 1.3 Functor 2. Encapsulation of set 3. Encapsulation of map 1. Generics of red-black trees By looking at the source code, we found that the bottom […]

## [Binary tree, complete binary tree, full binary tree, complete binary tree]

The concept and structure of tree The concept of tree Tree is a non-linear data structure, which is a set of hierarchical relationships composed of (n>=0) limited nodes. Call it It is called “tree” because it looks like a hanging tree, that is to say, it has the roots facing up and the leaves facing […]

## Binary tree sequential storage structure

Table of Contents 1. Binary tree sequential storage structure 2. Concept and structure of heap 3. Heap related interface implementation 3.1 Heap insertion and upward adjustment algorithm 3.1.1 Upward adjustment algorithm 3.1.2 Heap insertion 3.2 Heap deletion and downward adjustment algorithm 3.2.1 Downward adjustment algorithm 3.2.2 Heap deletion 3.3 Other interfaces and code implementations 4. […]

## 110. Balanced Binary Tree

110. Balanced Binary Tree 1. Question description 2. Supplementary content 3. Ideas for this question 3.1 Recursion 3.1.1 Clarify the parameters and return values of recursive functions 3.1.2 Clear termination conditions 3.1.3 Clarify the logic of single-level recursion 3.2 Iteration 4. Summary 5. Specific code implementation 5.1 Recursive method 5.2 Iterative method 5.3 Optimization iteration […]

## Codeforces Beta Round #19 D Segment Tree

D. Points time limit per test2 seconds memory limit per test256 megabytes Pete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0,?0) is located in the bottom-left corner, Ox axis is directed right, Oy axis is directed up. Pete […]

## Codeforces 19 D. Points (line segment tree & set good questions)

D.Points time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Pete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0,?0) is located in the bottom-left corner, Ox axis is directed […]