What is the main difference between information and keys?

Question

Algorithms

What is the difference between information in trees and keys?

Answer 1

In continuity.

Answer 2

Information in trees is...
• keys (ie string in ) • any information that the programmer has attached to tree elements (ie int in ) • information that serves to keep the tree itself and its balance: pointers, the R/B flag … map<string, int>

Answer 3

If you take the Bloom filter, then there is basically no information in it. There are only keys. Furthermore. Stochastic. Moreover, any attempt to expand the structure ends in failure.
So maybe it's not worth raising the question of dividing the universe into keys and non-keys?
Otherwise, some of the data structures will have to be thrown away.