   # A penultimate branch page is a branch page whose children are leaf pages. If
   # a branch page is not penultimate, then its children are branch pages.
   #
-  # In a penultimate branch page, the array of children is ordered by the b-tree
+  # In a penultimate branch page, the array of children is ordered by the
+  # b&#x2011;tree
   # collation using a first record in the referenced leaf page for ordering.
   # That is, the first record of the leaf page is used as the key associated
   # with a page address in a penultimate branch page.
   #
-  # The non-leaf nodes of a b-tree have the property that the number of node
+  # The non-leaf nodes of a b&#x2011;tree have the property that the number of node
   # children is one greater than the number of keys. We obtain this property by
   # treating the first child as the left child of the entire page, and excluding
   # its key from the search. We search the subsequent keys to find the first key


  # Write a delete object. Calculate the serialized JSON string length of the
  # inserted record and add it to the in memory JSON size of the page and the in
  # memory b-tree as a whole.
  #
  # TODO Document `ghost`.
  writeDelete: (fd, page, index, ghost, _) ->

  # the left most leaf page of a child and using the leaf page page key.
  # * The root branch page is always at address `0`.
  #
  # To find the a record in the b&#x2011;tree, we first use a tree of branch pages to
  # find the leaf page that contains our record.
  #
  # A branch page contains the addresses of child pages. This array of page
  # addresses is essentially an *array of children*.
  #
  # The child addresses are ordered according to the b&#x2011;tree collation of the
  # keys of the directly or indirectly referenced leaf pages.
  #
  # There are three types of branch pages, penultimate branch pages, interior
