# Placement papers on Data Structure - Set 4

## Placement papers on Data Structure - Set 4

1. To represent hierarchical relationship between elements, which data structure is suitable?

Deque
Priority
Tree
All of above

2. A binary tree whose every node has either zero or two children is called

Complete binary tree
Binary search tree
Extended binary tree
None of above

3. The depth of a complete binary tree is given by

Dn = n log2n
Dn = n log2n+1
Dn = log2n
Dn = log2n+1

4. Which of the following data structure store the homogeneous data elements?

Arrays
Records
Pointers
None

5. A binary tree can easily be converted into q 2-tree

by replacing each empty sub tree by a new internal node
by inserting an internal nodes for non-empty node
by inserting an external nodes for non-empty node
by replacing each empty sub tree by a new external node

ANSWER: by replacing each empty sub tree by a new external node

6. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

underflow
overflow
housefull
saturated