import std.container.rbtree;

import std.stdio;

​

struct Interval

{

    int start;

    int end;

}

​

alias IntervalTree = RedBlackTree!(Interval, (i1, i2) => i1.start < i2.start);

​

void main()

{

    auto t = new IntervalTree([Interval(20, 36), Interval(3, 41), Interval(29, 99), Interval(0, 1), Interval(10, 15)]);

    writefln("In-Order traversal\n%s\n", t);

    writefln("Lower-Bound intervals range\n%s", t.lowerBound(Interval(1, 10)));

}