Please Solve the Answer Accordingly and do not copy from others make sure you provide reasoning with your answer. I will dislike if the answer is poor

Which of the following scenarios has the worst runtime complexity, where the problem size is the number of elements stored in a singly-linked list defined by both its head and tail instance fields? Hint: Drawing a diagram of a chain of singly linked nodes with head and tail references will help you answer this question correctly. You may assume the list is not empty when considering complexity. Suppose you are given the following tree (with some node values hidden). Which of the following data structures might this tree be implementing? Select ALL which apply. binary search tree min-heap max-heap What would be the content of the following array-heap (max-heap) after is called? Hint: draw out the binary heap structure to help yourself trace through the problem. heap: {100,60,70,50,40,30,20,35,45,15,5,10,25} Consider the following implementation of insert helper method in a binary search tree: Which of the following statements about this insertHelper is TRUE? There is no problem with this method. This is a correct implementation. The condition (c0). The clauses for the conditions (current == null) and (c==0) need to be swapped. Setting current = newNode does not store the new node in the tree