DATA STRUCTURES 2ND INTERNAL ASSIGNMENT QUIZ 2024

The circular queue will be full only when

• FRONT=MAX-1 and REAR=MAX-1

• FRONT =0 and REAR= MAX-1

• FRONT =MAX-1 and REAR= 0

• FRONT=0 and REAR=0

In ______ , deletions can be done only at one end while insertiond can be done from both the ends

Elements in a priority queue are processed sequentially

• True

• False

In a priority queue, two elements with the same priority are processed on a FCFS basis.

• True

• False

Deque is implemented using ______

• Circular Array

• Circular doubly linked list

• Circular queue

• Circular array or circular doubly linked list

Degree of a leaf node is ___

• 0

• 1

• 2

• 3

Pre order traversal is also called ______

A binary tree of n nodes has exactly n-1 edges

• True

• False

Nodes at the same level that share the same parent are called _____

Two binary trees are said to be copies if they have similar ____________ and __________