#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include"IntervalTree.h"
void main()
{
	time_t t;
	int A[5],i,temp;
	IntervalTNode B[5];
	pIntervalTNode pb,tRoot;
	tRoot=NULL;
	pb=B;
	
	srand((unsigned)time(&t));
	for(i = 0;i < 5;i++)
	{
		A[i] = rand() % 20;
	}
	for(i=0;i<5;i++)
	{
		B[i].low=A[i];
		B[i].high=A[i]+5;
		B[i].max=B[i].high;
		B[i].clr=red;
		B[i].lChild=NULL;
		B[i].parent=NULL;
		B[i].rChild=NULL;
	}
	printf("先將以下數據順序插入到區間樹中：\n");
	for(i = 0;i < 5;i++)
	{
		printf("%d:low=%d,high=%d,max=%d  ",i+1,B[i].low,B[i].high,B[i].max);
	}
	printf("\n");

	for(i=0;i<5;i++)
	{
		IntervalTInsert(&tRoot,pb);
		pb++;
	}
	//InorderIntTWalk(tRoot);
	//printf("\n");
	temp=rand()%20;
	printf("將搜尋以下區間：[%d,%d]",temp,temp+5);
	pb=IntervalSearch(tRoot,temp,temp+5);
	if(pb!=NULL)
		printf("找到重疊區間： x=[%d,%d]\n",pb->low,pb->high);
	else printf("沒找到重疊區間\n");
}