………. sorting is good to use when alphabetizing a large list of names.

Related Questions

• 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.
• In ……………, search start at the beginning of the list and check every element in the list.
• What differentiates a circular linked list from a normal linked list?
• Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
• There is an extra element at the head of the list called a ……….
• Each node in a linked list has two pairs of ………….. and ……………….
• A …………………… does not keep track of address of every element in the list.
• The disadvantage in using a circular linked list is …………………….
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.