basic definition

OneCodeMonkey · OneCodeMonkey · commit 08d94ee34e06 · 2019-08-20T15:37:34.000+08:00
diff --git a/Algorithm_full_features/search/RedBlackBST.java b/Algorithm_full_features/search/RedBlackBST.java
@@ -0,0 +1,28 @@
+/**
+ * A symbol table implemented using a left-leaning red-black BST.
+ * 
+ */
+import java.util.NoSuchElememtException;
+
+public class RedBlackBST<Key extends Comparable<Key>, value> {
+	private static final boolean RED = true;
+	private static final boolean BLACK = false;
+
+	private Node root;		// root of the BST
+
+	// BST helper node data type
+	private class Node {
+		private Key key;		// key
+		private Value val;		// associated data
+		private Node left, right;	// links to left and right subtrees
+		private boolean color;		// color of parent link
+		private int size;		// subtree count
+
+		public Node(Key key, Value val, boolean color, int size) {
+			this.key = key;
+			this.val = val;
+			this.color = color;
+			this.size = size;
+		}
+	}
+}
