For the following questions answer them individually
Whichof the following operations is performed moreefficiently by doubly linkedlist than by linear linked list?
A complete binary tree with the property that the value at each — nodeis at least as large as the valuesat its children is known as
How many comparisonsare neededto sort an array of length 5 if a straight selection sort is used andarray is already in the opposite order ?
Consider the graph shown in the figure below.
Which of the following is a valid strong component ?