code: func (n *node) del(key []byte) {
  	// Find index of key.
  	index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, key) != -1 })
  
  	// Exit if the key isn't found.
  	if index >= len(n.inodes) || !bytes.Equal(n.inodes[index].key, key) {
  		return
  	}
  
  	// Delete inode from the node.
  	n.inodes = append(n.inodes[:index], n.inodes[index+1:]...)
  
  	// Mark the node as needing rebalancing.
  	n.unbalanced = true
  }
docs: // del removes a key from the node.