GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 16-20 of 100

0% completed (0/100 answered)

Question 16

MCQ · Single Correct 1 mark

Which condition is sufficient for a binary tree to be complete?

A All levels except possibly the last are full, and the last level is filled left to right B The last level must be full C All nodes must have two children D Every leaf must be at the same depth

Question 17

MCQ · Single Correct 1 mark

In a 0-based array representation of a binary heap, what is the index of the left child of node i?

A 2i + 2 B 2i C 2i + 1 D i + 1

Question 18

MCQ · Single Correct 1 mark

In a 0-based array representation of a binary heap, what is the index of the right child of node i?

A 2i + 2 B 2i + 3 C 2i + 1 D i + 2

Question 19

MCQ · Single Correct 1 mark

In a max-heap, which property is guaranteed for every node with a parent?

A The child is at least the parent B The parent is unrelated to the child C All keys in the tree are equal D The parent's key is at least the child's key

Question 20

MCQ · Single Correct 1 mark

What is the worst-case time complexity of searching in a skewed BST with n nodes?

A O(1) B O(n log n) C O(log n) D O(n)