   # can search for a record in a leaf page using binary search in logorithmic
   # time.
   #
-  # Leaf pages cannot contain duplicate records. Therefore, the b-tree cannot
+  # Leaf pages cannot contain duplicate records. Therefore, the b&#x2011;tree cannot
   # contain duplicate records. You can simulate duplicate records by adding a
   # series value to your key. The cursor implementation is designed faciliate
   # psuedo-duplicates in this fashion.

#
# Both branch pages and leaf pages are singly linked to their right sibling. If
# you hold a lock on a page, you are allowed to obtain a lock on its right
# sibling. This left right ordering allows us to traverse a level of the b-tree,
# which simplifies the implemtation of record cursors and page merges.
#
# When we move from a page to its right sibling, we hold the lock on the left

# A mutator is an iterator that can also edit leaf pages. It can delete records
# from the currently visit leaf page. It can insert records into the current
# leaf page, if the record belongs in the current leaf page. Like an `Iterator`
# it  moves bacross the leaf pages of an the b&#x2011;tree in ascending collation
# order. It has random access to the records in the page using an index into the
# array of records.
#
