DS Mid Review

In the Tree, the top node called:

• Child

• Root

• Siblings

• Parent

In the Stack, insert and delete can be performed in only one position, called:

• Top

• Pop

• Push

• Enqueue

Binary tree is full if each node has 2 or 0 children

• True

• False

One of the applications of the Stack is converting Infix to Postfix expressions

• True

• False

The running time for the following code is:

for (i=0; i<n; i++)

for (j=0; j<n; j++)

k++;

• O(N)

__________ of an element is allowed at the rear of the Queue.

• Removal

• Merging

• Insertion

• Copy

In the Simple Linked List, which of the following requires executing two reference update (change):

• Insert

• Delete

In Linked list, each node contains a minimum of two fields. One field is data field to store the data second field is?

• Pointer to character

• Pointer to integer

• Pointer to node

• Node

The worst case running time is:

• Little o

• Omega Ω

• Theta θ

• Big O

If we make implementations of the List ADT using ArrayList, insertion of new items and removal of existing items is cheap.

• True

• False