What method should I use to insert nodes into a data structure to guarantee a time complexity better than O(n) for insertion, deletion, and searching?

The best data structures in terms of asymptotic time complexities for performing the following operations respectively are CONCATENATION (A, B): Concatenate all elements of A and B together Insert(T, key): Insert key to T Delete (T, key): Delete key from T if present Search (T, key): Returns true if key is present in T Stack, Binary Search Tree, Sorted Array, Linked List Linked List, Stack, Binary Search Tree, Sorted Array Linked List, Stack, Sorted Array, Binary Search Tree Stack, Linked List, Sorted Array, Binary Search Tree

Present an algorithm (in outline form) for inserting an element into a sorted linked list so that the list is always in sorted order. Do not utilize a sorting routine, but rather devise an insert (add) algorithm that will search the list and insert the new element in the proper place in the list so that the list is always in order.  Assume that the objects involved all properly override both the equals (==) and the compareTo (>, <, >=, and <=) methods.  The list is to be maintained in ascending order.  Assume that the add method has the following signature.  public void Add(E element)

Please explain in as much detail as possible. Within one paragraph. It’s possible to ensure that an insertion sort implementation runs in linear time on a list that’s already sorted. How?