 This is done by a "wandering tree" update.The lowest node in the tree (i.e., the data) is written first, each node is written ascending the tree, until the root inode is updated.Writing the root last maintains atomicity of the update.