code: func (l *lNode) removed(e *Entry) *lNode {
  	idx := l.FindIndex(func(sn interface{}) bool {
  		return bytes.Equal(e.Key, sn.(*sNode).Key)
  	})
  	if idx < 0 {
  		return l
  	}
  	nl, _ := l.Remove(uint(idx))
  	return &lNode{nl}
  }
docs: // removed creates a new L-node with the entry removed.