Skip to content

Commit dea79bd

Browse files
authored
Fix typo
1 parent 8f54d34 commit dea79bd

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

_parts/part7.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -66,7 +66,7 @@ Let's say that the capacity of a leaf node is two key/value pairs. When we inser
6666

6767
The internal node has 1 key and 2 pointers to child nodes. If we want to look up a key that is less than or equal to 5, we look in the left child. If we want to look up a key greater than 5, we look in the right child.
6868

69-
Now let's insert the key "2". First we look up which leaf node it would be in if it was present, and we arrive at the left leaf node. The node is full, so we split the leaf node and create create a new entry in the parent node.
69+
Now let's insert the key "2". First we look up which leaf node it would be in if it was present, and we arrive at the left leaf node. The node is full, so we split the leaf node and create a new entry in the parent node.
7070

7171
{% include image.html url="assets/images/btree4.png" description="four-node btree" %}
7272

0 commit comments

Comments
 (0)