 # #### Deadlock Prevention and Traversal Direction
 #
 # To prevent deadlock, we always move form a parent node to a child node, or
-# form a left sibling to a right sibling. 
+# form a left sibling to a right sibling.
 #
 # **TK**: Chunky.
 #

  # essentially a log. Each time we write to the log, we open and close the
  # file, so that the operating system will flush our writes to disk. This gives
  # us durability.
  # 
  # The caller determines which file should be written, so it opens and closes
  # the file descriptor. For record insertions and deletions, a file descriptor
  # is opened and closed for a single append. When rewriting an existing leaf

# the leaves.
#
# Terms specific to our implementation will be introduced as they are
# encountered in the document.
#
# ## What is a b&#x2011;tree?
#
