Tree and Association List

First, let's compare the tree and the link list.

The function that can only be used in the connection list is fast on the connection list, right?

Then, an algorithm that only inserts and deletes a lot will need a connection list.

For example, Joseph's problem. (But this problem needs to be implemented in an annular list that's a little more difficult to implement.))