Knowledge about complexity classes is an issue that at least many hobbyists seem to miss.
Study time complexity of insertion, deletion, search, etc. in these data structures. Then you will understand when to use which. Big O notation is used to express time complexity for expected runtime of the operations.