posts: gap-buffer: fix typo

content/posts/2024-07-20-treap/index.md

@@ -31,7 +31,7 @@ parent's priority is always higher than any of its children.
 ## What does it do?
 
 By randomizing the priority value of each key at insertion time, we ensure a
-high likelihood that the tree stays _roughly_ balanced, avoiding degenerating to
+high likelihook that the tree stays _roughly_ balanced, avoiding degenerating to
 unbalanced O(N) height.
 
 Here's a sample tree created by inserting integers from 0 to 250 into the tree:
@@ -41,8 +41,8 @@ Here's a sample tree created by inserting integers from 0 to 250 into the tree:
 ## Implementation
 
 I'll be keeping the theme for this [series] by using Python to implement the
-_Treap_. This leads to somewhat annoying code to handle the rotation process,
-which is easier to do in C using pointers.
+_Treap_. This leads to somewhat annoying code to handle the `left`/`right` nodes
+which is easier to do in C, using pointers.
 
 [series]: {{< ref "/series/cool-algorithms/" >}}