docs: def get_distance(self, other, lbda=0.5, min_overlap=4):
          """
          Return the Euclidean distance between vectors v of
          two trees. Must have the same leaf set (too lazy to check).
          """
          if self.tree ^ other.tree:
              if len(self.tree & other.tree) < min_overlap:
                  return 0
                  # raise AttributeError('Can\'t calculate tree distances when tree overlap is less than two leaves')
              else:
                  t1, t2 = self._equalise_leaf_sets(other, False)
                  tmp_self = KendallColijn(t1)
                  tmp_other = KendallColijn(t2)
  
                  return np.sqrt(((tmp_self.get_vector(lbda) - tmp_other.get_vector(lbda)) ** 2).sum())
          else:
              return np.sqrt(((self.get_vector(lbda) - other.get_vector(lbda)) ** 2).sum())