Given a (2,4)-Tree T saving String objects, an integer k, and two strings s1 and s2, an (s, s1, s2)-cover of T is a set of nodes of T that jointly contain at least k strings
