FGH#$%^&*()RTGSDZXVC VBHNJKOP)(*&^%TRERTY^&*(U)IPOKLMMNBFDRT%^

Which data structure is linear ?

• Array
• Graph
• Tree
• Double Linked list

Which data structure is NON-LINEAR ?

• Single Linked List
• Stack
• Queue
• Double Linked list

The maximum hight of a binary search tree of N nodes is …..

• Log N
• N Log N
• N
• 2^N

The minimum hight of a binary search tree with N nodes is…..

• Log N
• N Log N
• n
• 2^N

An AVL tree is also a binary search tree. The statement is ____

• True
• False

The maximum hight of a AVL tree of N nodes is …..

• Log N
• N Log N
• N
• 2^N

The minimum hight of a AVL tree with N nodes is…..

• Log N
• N Log N
• n
• 2^N

How many traversing of head pointer of a single linked list is required to catch a node of distance K from the first node. Assume head node is at distance 0.

• K-1
• K
• K+1
• K+2

Assume that you want to design a data structure for a Library to store the records of books. Which type of data structure is required to find its availability

• Tree
• Graph
• Stack
• Queue

Assume that you want to design a data structure for a Library to store the students request to issue books. Which type of data structure will be a transparent approach ?

• Tree
• Graph
• Stack
• Queue