Data Structures

• Garbage value

• 10

• 50

• 0

How many children does a binary tree have?

• 2

• any number of children

• 0 or 1 or 2

• 0 or 1

What data structure is used for breadth first traversal of a graph?

• queue

• stack

• list

• none of the above

One can convert a binary tree to its mirror image by traversing it in

• Inorder

• Preorder

• Postorder

• None of the above

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

• Queue

• Circular queue

• Dequeue

• Priority queue

Which of the following data structures can be used for parentheses matching?

• n-ary tree

• queue

• priority queue

• stack

Process of removing an element from stack is called __

• Create

• push

• pop

• peek

A queue follows __________

• FIFO (First In First Out) principle

• LIFO (Last In First Out) principle

• Ordered array

• Linear tree

Circular Queue is also known as ________

• Ring Buffer

• Square Buffer

• Rectangle Buffer

• Curve Buffer

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC