Depending on the implementation of the data type, attempting to add a duplicate element may either be ignored, overwrite the existing element, or raise an error.
The detection for duplicates is based on some inbuilt (or alternatively, user-defined) rule for comparing elements.
A data structure is said to be linear if its elements form a sequence.
In these data structures each tree node compares a bit slice of key values.
Many graph-based data structures are used in computer science and related fields: