b24adf31d6b7e7820ef221d45166ff597db29799
kent
  Thu Aug 28 13:12:19 2014 -0700
Fixed typo in comment.
diff --git src/lib/hacTree.c src/lib/hacTree.c
index dda1b97..f82aba6 100644
--- src/lib/hacTree.c
+++ src/lib/hacTree.c
@@ -283,31 +283,31 @@
     // root now has a stable address, unlike nodes still in the pool, so set parents here:
     if (root->left != NULL)
 	root->left->parent = root;
     if (root->right != NULL)
 	root->right->parent = root;
     }
 // This shouldn't be necessary as long as initNode leaves parent pointers alone,
 // but just in case that changes:
 root->parent = NULL;
 return root;
 }
 
 /** The code from here on down is an alternative implementation that calls the merge
  ** function and for that matter the distance function much less than the function
  ** above, and also is multithreaded.  It does seem to produce the same output
- ** but the algorigthm is sufficiently different, at least for now, I'm keeping
+ ** but the algorithm is sufficiently different, at least for now, I'm keeping
  ** both. */
 
 
 #define distKeySize 64  
 
 static void calcDistKey(void *a, void *b, char key[distKeySize])
 /* Put key for distance in key */
 {
 safef(key, distKeySize, "%p %p", a, b);
 }
 
 void hacTreeDistanceHashAdd(struct hash *hash, void *itemA, void *itemB, double distance)
 /* Add an item to distance hash */
 {
 char key[distKeySize];