# Basic CS-Data Structures [3i Infotech Placement]: Sample Questions 52 - 52 of 52

Glide to success with Doorsteptutor material for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

## Question 52

Data Structures

### Question

MCQ▾Of the following tree structure, which is, efficient considering space and time complexities?

### Choices

Choice (4) | |
---|---|

a. | Complete Binary Tree |

b. | Incomplete Binary Tree |

c. | Full Binary Tree |

d. | All of the above |

### Answer

a.### Explanation

**Complete or perfect Binary Tree**

- A binary tree in which every level, except possibly the last, is completely filled.
- Generalization: Complete tree, binary tree.
- Specialization: Binary heap, perfect binary tree.

- A complete binary tree has nodes at every depth k < n.
- A complete binary tree of depth n has nodes.
- Efficiently implemented as an array- a node at index i has children at indexes and and a parent at index , with 1-based indexing.
- If child index is greater than the number of nodes, the child does not exist.