algorithm - handling collisions in associative array implemented using self-balancing tree -

How are conflicts in simplified arrays implemented using self-balanced trees? If two objects have the same hash, then they are stored in a linked node or a linked list linked to two nodes? If this is in the past, then how is it o (log n) and if later, what type of key (hash) can handle binary search?

Search trees can certainly not handle two nodes with the same key, Entries with collocating keys need to be stored in different data structures (usually, as you say, a link list attached to a tree node). You will not really have the complexity of the worst position of O (log n), such that an Associated array implemented as a hash table will not have bad-case o (1) operation.

As an example, one thing to try is to increase the length of your hash keys so that there is no confrontation. You can not guarantee that you do not need to do some kind of provision for two objects, however, and in the same way. If you choose your hashing algorithm properly, however, it should be a rare case, and the complexity of time for your average lookup will be (log n), even if it is O (n) The incomplete case of everything being the same hash key.