/* We can't allocate nodes ourselves, because only the caller knows how.
* Instead, insertion is split into two operations: `treap_probe' looks to
* see whether a matching node is already in the treap, and returns it if so;
- * otherwise, it flls in this `treap_path' structure, which is passed back to
- * `treap_insert' to help it add the fresh node into the treap. (See the
+ * otherwise, it fills in this `treap_path' structure, which is passed back
+ * to `treap_insert' to help it add the fresh node into the treap. (See the
* commentary in `treap_probe' and `treap_insert' for the details.)
*/
#define TREAP_PATHMAX 64