a44421a79fb36cc2036fe116b97ea3bc9590cd0c
braney
  Fri Dec 2 09:34:39 2011 -0800
removed rcsid (#295)
diff --git src/lib/rbTree.c src/lib/rbTree.c
index 27ee69d..42952f8 100644
--- src/lib/rbTree.c
+++ src/lib/rbTree.c
@@ -1,27 +1,26 @@
 /* rbTree - rbTreeRed-rbTreeBlack Tree - a type of binary tree which 
  * automatically keeps relatively balanced during
  * inserts and deletions.
  *   original author: Shane Saunders
  *   adapted into local conventions: Jim Kent
  */
 
 #include "common.h"
 #include "localmem.h"
 #include "rbTree.h"
 
-static char const rcsid[] = "$Id: rbTree.c,v 1.12 2008/10/16 02:39:51 kent Exp $";
 
 
 static struct rbTreeNode *restructure(struct rbTree *t, int tos, 
 	struct rbTreeNode *x, struct rbTreeNode *y, struct rbTreeNode *z)
 /* General restructuring function - checks for all
  * restructuring cases.  Call when insert has messed up tree.
  * Sadly delete has to do even more work. */
 {
 struct rbTreeNode *parent, *midNode;
 
 if(y == x->left) 
     {
     if(z == y->left) 
         {  /* in-order:  z, y, x */
 	midNode = y;