M

Mr. Dubey • 53.50K Points
Coach 

Q. Which of the following is false about a circular linked list?

(A) Every node has a successor
(B) Time complexity of inserting a new node at the head of the list is O(1)
(C) Time complexity for deleting the last node is O(n)
(D) We can traverse the whole circular linked list by starting from any point
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The set O of odd positive integers less than 10 can be expressed by ___________

Q. The space required to store the adjacency matrix of a graph with n vertices is

Q. Which of the following is not an application of stack?

Q. On multiplication of (10.10) and (01.01), we get

Q. Why does site history have to be considered for hazard identification?

Q. The equation V(G)= No. of predicated nodes+1 is applicable only when node has

Q. Which of the following is not a combinational circuit?

Q. If R is reflexive, symmetric and transitive then the relation is said to be ________.

Q. The binary value ' 1010110 ' is equivalent to decimal

Q. Which is the most straightforward approach for planning algorithm?

Question analytics