作者: David E. Joslin , Laerte F. Morgado
DOI:
关键词: AVL tree 、 Algorithm 、 Segment tree 、 Interval tree 、 K-ary tree 、 Mathematics 、 Theoretical computer science 、 Tree (data structure) 、 Binary tree 、 Vantage-point tree 、 Range tree
摘要: A method of using a binary tree data structure to represent time-varying variable, and solve queries about the variable. The is especially useful for solving 'find' type queries, such as 'What earliest/latest time when minimum y units are on hand ?'. This query can be solved with an efficiency O(log n), where n number nodes tree.