class IntervalTree::Node

def search(query)
  search_s_center(query) +
    (left_node && query.begin.to_r < x_center && left_node.search(query) || []) +
    (right_node && query.end.to_r > x_center && right_node.search(query) || [])
end