Everything About ___
Live briefing

Everything about Segment tree

Computer science data structure

In computer science, the segment tree is a data structure used for finding the result of some associative function on a contiguous sub-array in just O(log n) time. Commonly, the data structure is used for summation, product, maximum or minimum. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Segment treeA 5-minute orientation
  2. Skim a recent paper: Individual tree segmentation and tree species classification in subtropical broadleaf forests using UAV-based LiDAR, hyperspectral, and ultrahigh-resolution RGB dataInfluential work since 2022
  3. Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
  4. Read the landmark paper: The 'segment length curse' in long tree-ring chronology development for palaeoclimatic studiesCited 601 times
  5. Go sideways: Interval treeA closely related topic
  6. Go sideways: Range treeA closely related topic

📖 Definitions

Noun A data structure that is used to store information about intervals (segments) and perform range queries, or queries on a set of intervals, in logarithmic time.

🗂️ The subject at a glance

  1. Definition
  2. History
  3. Sources cited

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics