This document provides an example of insertions and deletions in a B+-tree of order 1. It shows the tree being modified through 11 steps: inserting values 19 and 27, requiring splits at multiple levels; deleting values 5, 9, 12, 4, and 11 through leaf node merges and key removals up the tree; ultimately merging all nodes so the root is removed.