* This is similar to `treap_lookup', in that it returns the
* requested node if it already exists, or null otherwise, but it
* also records in P information to be used by `treap_insert' to
- * insert a new node with the given key it's not there already.
+ * insert a new node with the given key if it's not there already.
*/
extern void treap_insert(struct treap */*t*/, const struct treap_path */*p*/,