code: func (sl *SkipList) Get(comparators ...common.Comparator) common.Comparators {
  	result := make(common.Comparators, 0, len(comparators))
  
  	var n *node
  	for _, cmp := range comparators {
  		n, _ = sl.search(cmp, nil, nil)
  		if n != nil && n.Compare(cmp) == 0 {
  			result = append(result, n.entry)
  		} else {
  			result = append(result, nil)
  		}
  	}
  
  	return result
  }
docs: // Get will retrieve values associated with the keys provided.  If an
  // associated value could not be found, a nil is returned in its place.
  // This is an O(log n) operation.