code: func (ot *orderedTree) Query(interval Interval) Entries {
  	entries := NewEntries()
  
  	ot.apply(ot.top, interval, 1, func(n *node) bool {
  		entries = append(entries, n.entry)
  		return true
  	})
  
  	return entries
  }
docs: // Query will return an ordered list of results in the given
  // interval.