CODING MART

Insertion of an element at the middle of a linked list requires the modification of how many pointers?

• 1

• 2

• 3

• 4

Insertion of an element at the ends of a linked list requires the modification of how many pointers?

• 1

• 2

• 3

• 4

What is the time complexity to insert an element to the front of a LinkedList(head pointer given)?

• o(1)

• o(n)

• o(log n)

• None of the above

What is the time complexity of a program to reverse a linked list?

• O(n)

• O(1)

• O(n^2)

• None of the above

A linked list in which none of the nodes contains a NULL pointer is?

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• None of the above

In a circular linked list insertion of a record requires the modification of?

• 3 pointer
• 5 pointer
• 2 pointer
• 1 pointer

Which of the following sorting algorithms is preferred to sort a linked list?

• Insertion Sort
• Quick Sort
• Merge Sort
• Bubble Sort

A binary search tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24

The number of the node in the left sub-tree and right sub-tree of the root, respectively, is

• 7,4

• 4, 7
• 6, 5
• 3, 8

Which of the following statement about binary tree is CORRECT?

• Every binary tree is either complete or full

• Every complete binary tree is also a full binary tree

  
  

• Every full binary tree is also a complete binary tree

• A binary tree cannot be both complete and full