-
Notifications
You must be signed in to change notification settings - Fork 0
/
IntervalTree.h
50 lines (28 loc) · 1 KB
/
IntervalTree.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#ifndef INTERVALTREE_H
#define INTERVALTREE_H
#include <iostream>
#include <stdlib.h>
#include "IntervalNode.h"
#include <vector>
using namespace std;
class IntervalTree{
public:
IntervalNode *root;
IntervalNode *sentinel;
IntervalTree();
vector<Interval*> search(int value);
void search(Interval *i, vector<IntervalNode*> &result);
Interval *searchFirstOverlapping(Interval *i);
void searchSubTree(IntervalNode *node, Interval *i, vector<IntervalNode*> &result);
IntervalNode *findInterval(IntervalNode *tree, int destId, Interval *i);
void searchSubTree(IntervalNode *node, int value, vector<Interval*> &result);
void add(int destId, Interval *interval);
void insertInterval(int destId, Interval *interval, IntervalNode *currentNode);
void renewConstraintsAfterInsert(IntervalNode *node);
void removeNode(IntervalNode *node);
void renewConstraintsAfterDelete(IntervalNode *node);
void rotateLeft(IntervalNode *node);
void rotateRight(IntervalNode *node);
void printTree();
};
#endif