GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 81-85 of 100

0% completed (0/100 answered)

Question 81

MSQ · Multiple Correct 2 mark

Which statements about heaps are correct?

A Bottom-up build-heap is O(n). B Heap insertion is O(log n) worst case. C Arbitrary search is O(n) worst case. D A binary heap is necessarily a BST.

Question 82

MSQ · Multiple Correct 2 mark

Which statements about AVL trees are correct?

A Each node has balance factor in {-1,0,1} after rebalancing. B AVL height is O(log n). C Insertion may require a rotation. D AVL trees are always complete binary trees.

Question 83

MSQ · Multiple Correct 2 mark

Which statements about tries are correct?

A They support prefix-based queries naturally. B Search time depends primarily on key length. C They can store strings with shared prefixes efficiently. D They require keys to be numeric.

Question 84

MSQ · Multiple Correct 2 mark

Which statements about a tree with n vertices are correct?

A It has exactly n-1 edges. B There is exactly one simple path between any two vertices. C It is connected. D It may contain a cycle.

Question 85

MSQ · Multiple Correct 2 mark

Which statements about expression trees are correct?

A Preorder gives prefix notation. B Inorder gives infix notation, subject to parentheses for structure. C Postorder gives postfix notation. D Level order gives postfix notation.