Below are some of the well known data structures and their Java implementation. Simply click on each highlighted item to view the code and explanations.
Access: O(n) Insertion: O(1) Deletion: O(1)
Access: O(n) Insertion: O(1) Deletion: O(1)
Access: O(n) Insertion: O(Log(n)) Extract Max: O(1)
Access: O(h) Insertion: O(h) Deletion: O(h), h = Log(n) if balanced
Access: O(1) Insertion: O(1) Deletion: O(1)