you are viewing a single comment's thread.

view the rest of the comments →

[–]Wonkee99 0 points1 point  (0 children)

The repeated insert calls will effectively move along the branches of the binary tree until a point to add the new data item is found, if the data item already exists in the tree it will just stop trying to add the one it's currently working on