Data structure for quick time interval look up

by

What you are looking for is an Interval Tree (which is a type of Range Tree).

These have logarithmic lookup time like other tree structures (e.g., RB trees), so you should see comparable performance to using something like a Java TreeMap or an STL map.

More Related Contents:

  1. How do I prove or disprove that this function is Ω(n^1.5)?
  2. How does a hash table work?
  3. How do I express mutually recursive data structures in safe Rust?
  4. Firebase data structure and url
  5. Implement graph-like data structure in Rust
  6. lenses, fclabels, data-accessor – which library for structure access and mutation is better
  7. Quadtree for 2D collision detection
  8. Advantages of Binary Search Trees over Hash Tables
  9. Difference between binary tree and binary search tree
  10. Data structure: insert, remove, contains, get random element, all at O(1)
  11. Are duplicate keys allowed in the definition of binary search trees?
  12. Searching a number in a rotated sorted Array
  13. Efficient implementation of immutable (double) LinkedList
  14. Efficient (and well explained) implementation of a Quadtree for 2D collision detection [closed]
  15. Why hashmap lookup is O(1) i.e. constant time?
  16. What is the left-child, right-sibling representation of a tree? Why would you use it?
  17. Test whether a list contains a specific value in Clojure
  18. Difference between “Complete binary tree”, “strict binary tree”,”full binary Tree”?
  19. Chained Hash Tables vs. Open-Addressed Hash Tables
  20. Linked List vs Vector
  21. How would you implement an LRU cache in Java?
  22. Is it possible to query a tree structure table in MySQL in a single query, to any depth?
  23. What is copy-on-write?
  24. How to correctly use lists?
  25. How do you validate a binary search tree?
  26. Best algorithm to test if a linked list has a cycle
  27. What is a hash table and how do you make it in C? [closed]
  28. When to use a List over an Array in Java?
  29. graph – Dijkstra for The Single-Source Longest Path
  30. How to implement a Median-heap

Leave a Comment