GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 76-80 of 100

0% completed (0/100 answered)

Question 76

MSQ · Multiple Correct 2 mark

Which statements about a max-heap are correct?

A The root contains the maximum key. B Every parent key is at least each child key. C The array representation is complete-tree based. D The heap must be a BST.

Question 77

MSQ · Multiple Correct 2 mark

Which statements about BST deletion are correct?

A A leaf can be removed directly. B A one-child node can be replaced by its child. C A two-child node can be replaced by its inorder successor. D Deletion always decreases the height.

Question 78

MSQ · Multiple Correct 2 mark

Which structures guarantee logarithmic height in n?

A AVL tree B Red-black tree C Ordinary unbalanced BST D B-tree with fixed minimum branching factor

Question 79

MSQ · Multiple Correct 2 mark

Which statements about B-trees are correct?

A All leaves are at the same depth. B Keys in a node are sorted. C A node can contain multiple keys. D Every node except the root must always contain exactly m-1 keys.

Question 80

MSQ · Multiple Correct 2 mark

Which statements about binary tree traversals are correct?

A Preorder can serialize a tree when null markers are included. B Inorder alone does not uniquely determine an arbitrary binary tree. C Postorder visits the root last. D Level order can be implemented with a queue.