A list which displays the relationship of adjacency between elements is said to be

Related MCQs

• Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________.
• What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
• If a list contains no elements it is said to be
• To represent hierarchical relationship between elements, Which data structure is suitable?
• To represent hierarchical relationship between elements, which data structure is suitable?
• To represent hierarchical relationship between elements, which data structure is suitable?
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• In ……………, search start at the beginning of the list and check every element in the list.