Linear table (A1 ~ (2),. , ai-1,ai,ai+1,. , an), uses a single linked list storage, the head pointer is H, each node stores an element in the linear table, and now looks for a node with an element value of x. Write the search statements for the following three cases respectively, requiring the search time to be as short as possible.
(1) the elements in the linear table are out of order.
(2) the elements in the linear table are incrementally ordered.
(3) the elements in the linear table are in descending order.

now that linked lists are used, whether the data is orderly or not has no effect on traversal. Can"t do