public LinkedList<interval> FindDuring (Node node, interval interval, long minStart, long maxStart, long minEnd, long maxEnd, LinkedList<interval> list){
    	//LinkedList<interval> list = new LinkedList<interval>();
    	
    	if (node.CurrentInterval != null)
        {
            if (node.During(interval, minStart, maxStart, minEnd, maxEnd))
            {
            	//CHEQUEAMOS SI YA EXISTE EN LA LISTA ANTES DE AGREGARLO
            	if(!list.contains(node.CurrentInterval))
            	{
            		list.add(node.CurrentInterval);
            	}
                if (CheckLeft(node))
                {
                    FindDuring(node.LeftNode, interval, minStart, maxStart, minEnd, maxEnd, list);
                }
                if (CheckRight(node))
                {
                    FindDuring(node.RightNode, interval, minStart, maxStart, minEnd, maxEnd, list);
                }
                if (CheckCenter(node.CenterNode))
                {
                    FindDuring(node.CenterNode, interval, minStart, maxStart, minEnd, maxEnd, list);
                }
            }
            else
            {
                if (CheckLeft(node))
                {
                    FindDuring(node.LeftNode, interval, minStart, maxStart, minEnd, maxEnd, list);
                }
                if (CheckRight(node))
                {
                    FindDuring(node.RightNode, interval, minStart, maxStart, minEnd, maxEnd, list);
                }
                if (CheckCenter(node))
                {
                    FindDuring(node.CenterNode, interval, minStart, maxStart, minEnd, maxEnd, list);
                }
            }

        }

        return list;

    }