Segment tree
Tree data structure used in computer science
In computer science, the segment tree is a data structure used for storing information about intervals or segments. It allows querying which of the stored segments contain a given point. A similar data structure is the interval tree.
Nº Q2377385 ★
Common · Knowledge
Segment tree
Tree data structure used in computer science
In computer science, the segment tree is a data structure used for storing information about intervals or segments. It allows querying which of the stored segments contain a given point. A similar data structure is the interval tree.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computer science, the segment tree is a data structure used for storing information about intervals or segments. It allows querying which of the stored segments contain a given point. A similar data structure is the interval tree. A segment tree for a set I of n intervals uses O(n log n) storage and can be built in O(n log n) time. Segment trees support searching for all the intervals that contain a query point in time O(log n + k), k being the number of retrieved intervals or segments. Applications of the segment tree are in the areas of computational geometry, geographic information systems and machine learning. The segment tree can be generalized to higher dimension spaces.
Text: Wikipédia, CC BY-SA 4.0. · Image: Cafce25 (CC BY-SA 4.0) ·
Related cards
K-d tree
Multidimensional search tree for points in k dimensional space
Nº Q309949 ★★
R-tree
Tree-based data structure, used to index spatial information
Nº Q1198051 ★★
Quadtree
Tree data structure in which each internal node has exactly four children
Nº Q934791 ★★
B-tree
A self-balancing, tree-based data structure, that allows read/write access in logarithmic time
Nº Q677051 ★★★
Tree structure
Way of representing the hierarchical nature of a structure in a graphical form
Nº Q2067937 ★★
Tree (graph theory)
Undirected, connected and acyclic graph
Nº Q272735 ★★★