[editing]search: RedBlack Binary Search tree

OneCodeMonkey · OneCodeMonkey · commit 50ca68ff9cb4 · 2019-08-20T15:41:37.000+08:00
diff --git a/Algorithm_full_features/search/RedBlackBST.java b/Algorithm_full_features/search/RedBlackBST.java
@@ -25,4 +25,43 @@ public Node(Key key, Value val, boolean color, int size) {
 			this.size = size;
 		}
 	}
+
+	// Initializes an empty symbol table.
+	public RedBlackBST() {
+		//
+	}
+
+	/***********************
+	 * Node helper methods *
+	 *					   *
+	 ***********************/
+
+	// is node x red
+	private boolean isRed(Node x) {
+		if(x == null)
+			return false;
+		return x.color == RED;
+	}
+
+	// number of node in subtree rooted at x; 0 if x is null
+	private int size(Node x) {
+		if(x == null)
+			return 0;
+		return x.size;
+	}
+
+	// Returns the number of key-value pairs in this symbol table.
+	public int size() {
+		return size(root);
+	}
+
+	public boolean isEmpty() {
+		return root == null;
+	}
+
+	/************************
+	 * Standard BST search. *
+	 * 						*
+	 ************************/
+	
 }
