Sweep-Line-Algorithm

1
/**
2
 * The Node for {@link RedBlackTree}.
3
 *
4
 * @param <T> the parameter of type
5
 */
6
public class Node<T extends Comparable<T>> {
7
    /**
8
     * Value of this {@link Node}.
9
     */
10
    T value;
11
    /**
12
     * Left child.
13
     */
14
    Node<T> left,
15
    /**
16
     * Right child.
17
     */
18
    right;
19
    /**
20
     * Color of this {@link Node}.
21
     */
22
    Colors color;
23

24
    /**
25
     * Instantiates a new {@link Node}.
26
     *
27
     * @param value the value of this {@link Node}
28
     */
29
    public Node(T value) {
30
        this.value = value;
31
        this.color = Colors.RED;
32
    }
33

34
    /**
35
     * Changes color of this {@link Node} and its children to opposite.
36
     */
37
    public void changeColor() {
38
        this.color = Colors.getOpposite(this.color);
39
        this.left.color = Colors.getOpposite(this.left.color);
40
        this.right.color = Colors.getOpposite(this.right.color);
41

42
    }
43
}
44