Linear Number of Nodes Processed
Let n be the size of the universe, m the number of sets, and s the sum of the sizes of the sets.
- Number of full nodes processed < 2s.
- Number of key nodes processed = m.
- Number of partial nodes with partial children processed below the key node < m + n.
- Number of partial nodes with no partial children with not partial children < 2m.
- Number of partial nodes processed above the key node < m + n.