GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 61-65 of 100

0% completed (0/100 answered)

Question 61

MCQ · Single Correct 1 mark

Which operation in a red-black tree can restore balance after insertion?

A Recoloring only B Rotation only C Heapification D Recoloring and rotations

MCQ · Single Correct 1 mark

What is the key-order property inside each node of a B-tree?

A Keys are in arbitrary order B Unsorted C Descending only D Keys are stored in sorted order

MCQ · Single Correct 1 mark

What is the typical time complexity of search in a B-tree with n keys?

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

MCQ · Single Correct 1 mark

What is the main reason B-trees are effective for secondary storage?

A Different depths B Only at the root C Their high branching factor reduces the number of disk accesses D Depth depends on key

MCQ · Single Correct 1 mark

In a B-tree, all leaves are at what relative depth?

A BST B Binary heap C The same depth D Trie