Insertion b) Deletion c) Retrieval d) Traversal

Related MCQs

• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
• The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
• Deletion of a node from an empty linked list will cause________
• Deletion in a linked list requeries modification of______pointers
• In doubly linked lists, traversal can be performed?
• When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
• The in order traversal of tree will yield a sorted listing of elements of tree in
• Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.