Added size

src/search/GeneralCompare.java

+package search;
+
+public interface GeneralCompare<T> {
+	public int compare(Comparable<T> a1, Comparable<T> a2);
+}

src/search/Node.java

@@ -30,7 +30,7 @@ public class Node<Key, Value, T>{
 		return this.val;
 	} 
 
-	public void val(Value val){
+	public void val(Comparable<T>[] val){
 		this.val = val;
 	}
 	
@@ -50,10 +50,14 @@ public class Node<Key, Value, T>{
 		this.right = right;
 	}
 	
-	public int N(){
+	public int n(){
 		return this.n;
 	}
 	
+	public void n(int n){
+		this.n = n;
+	}
+	
 	public boolean color(){
 		return this.color;
 	}

src/search/RedBlackTree.java

@@ -4,35 +4,76 @@ public class RedBlackTree<Key, Value> {
 	
 	private Node root;
 	
-	private int size();
+	private <T> int size(Comparable<T>[] val){
+		return val.length;
+	}
 	
 	public <T> void put(Key key, Comparable<T>[] val){
 		root = put(root, key, val);
 		root.color(false);
 	}
 	
-	private <T> Node put(Node h, Key key, Comparable<T>[] val){
-		Node root = new Node(key, val, n, color);
+	private boolean isRed(Node x){
+		return x.color();
+	}
+	
+	public Node rotateLeft(Node h){
+		Node x = h.right();
+		h.right(x.left());
+		x.left(h);
+		x.color(h.color());
+		h.color(true);
+		x.n(h.n());
+		h.n(1 + size(h.left()) + size(h.right()));
+		return x;
+	}
+	
+	public Node rotateRight(Node h){
+		Node x = h.left();
+		h.left(x.right());
+		x.right(h);
+		x.color(h.color());
+		h.color(true);
+		x.n(h.n());
+		h.n(1 + size(h.left()) + size(h.right()));
+		return x;
+		
+	}
+	
+	private void flipColors(Node h){
+		if(h.left() != null && h.right() != null){
+			h.left().color(false);
+			h.right().color(false);
+			h.color(true);
+		}
+	}
+	
+	private <T> Node put(Node h, Key key, Comparable<T>[] val, GeneralCompare<T> gc){
+		
+		int n = size(h);
+		
+		Node root = new Node(key, val, n, true);
 		
 		if(h == null)
 			return new Node(key, val, 1, true);
 		
 		int cmp = key.compareTo(h.key());
 		if(cmp < 0)
-			h.left(put(h.left(), key, val));
+			h.left(put(h.left(), key, val, gc));
 		else if (cmp > 0)
-			h.right(put(h.right(), key, val)); 
+			h.right(put(h.right(), key, val, gc)); 
 		else
 			h.val(val);
 		
-		if(isRed(h.right) && !isRed(h.left))
+		if(isRed(h.right()) && !isRed(h.left()))
 			h = rotateLeft(h);
-		if(isRed(h.left) && isRed(h.left.left))
+		if(isRed(h.left()) && isRed(h.left().left()))
 			h = rotateRight(h);
-		if(isRed(h.left) && isRed(h.right))
+		if(isRed(h.left()) && isRed(h.right()))
 			flipColors(h);
 		
-		h.n = size(h.left) + size(h.right) + 1;
+		h.n(size(h.left()) + size(h.right()) + 1);
+		
 		return h;
 	}
 }