public class MNode<E extends Comparable<E>>{
 private int size; //number of items in the node
 private MNode<E> left;
 private Pair<E>[] seq;
 private int capacity;//capacity of the sequence
 
 public MNode(int m){
	 size=0;
	 left=null;
	 seq= (Pair<E>[]) new Pair[m-1];//Compiler may warn, but ok
	 capacity=m-1;
 }
 
 public MNode(int k,MNode<E> m,Pair<E>[] seq1){
	 size=k;
	 left=m;
     seq=(Pair<E>[]) seq1.clone();
     capacity=seq.length;
	
 }
 
 /**create a new node just containing the value e*/
 public MNode(E e,int m){
	 Pair<E>[] myseq=(Pair<E>[]) new Pair[m-1]; //Compiler may warn, but ok
	 myseq[0]=new Pair<E>(e,null);
	 size=1;
	 left=null;
	 seq=myseq;
	 capacity=m-1;
 }
 
 
 public int getCapacity(){
	 return capacity;
 }

public int getSize() {
	return size;
}

public void setSize(int k) {
	size = k;
}

public MNode<E> getLeft() {
	return left;
}

public void setLeft(MNode<E> left) {
	this.left = left;
}

public Pair<E>[] getSeq() {
	return seq;
}

public void setSeq(Pair<E>[] seq) {
	this.seq = seq;
}

/**assuming size is < capacity, add element e in order*/
public void addElement(E e){
	int temp=0;
	while((temp<size)&&(seq[temp].val.compareTo(e)<0)) temp++;
	if (temp==size) seq[temp]=new Pair<E>(e,null);
	else{
		if (seq[temp].val.compareTo(e)>0){
		for(int i=size;i>temp;i--) seq[i]=new Pair<E>(seq[i-1]);
		seq[temp]=new Pair<E>(e,null);
	}
	}
	size++;
}

/**assuming size is >0, remove element e if present*/
public boolean removeElement(E e){
	return true;
	//to be completed
}
 

/** is this node a leaf?*/
public boolean isLeaf(){
	boolean temp=(left==null);
	int i=0;
	while((temp==true)&&(i<size)) {
		if (seq[i].right!=null) temp=false;
		i++;
	}
	return temp;
	
}
 
 
/**return String representation of node*/
public String toString(){
	String s="[";
	for (int i=0;i<size-1;i++) s=s+seq[i].getVal()+",";
	s=s+seq[size-1].getVal()+"]";
	return s;
}
}