| http://www.w3.org/ns/prov#value | - Also, the invention may apply to numerous types of each of these data structures, such as binary search trees, 2-3 trees, 2-3-4 trees, red-black trees, m-way search trees, b-trees, digital search trees, k-dimensional trees, min-max heaps, binomial heaps, f-heaps, etc., individually and/or collectively.
|
