GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 66-70 of 100

0% completed (0/100 answered)

Question 66

MCQ · Single Correct 1 mark

Which data structure is particularly suitable for prefix-based string lookup?

A O(log L) B Trie C $O(L^2)$ D O(n)

MCQ · Single Correct 1 mark

What is the time complexity of searching for a string of length L in a trie, ignoring alphabet lookup cost?

A B-tree B O(L) C Binary heap D BST

MCQ · Single Correct 1 mark

Which tree is commonly used to implement ordered dictionaries with guaranteed logarithmic height?

A Trie B Binary heap C AVL tree D Red-black tree

MCQ · Single Correct 1 mark

Which tree uses coloring constraints to guarantee O(log n) height?

A B-tree B Heap C Red-black tree D Trie

MCQ · Single Correct 1 mark

Which statement about a binary tree with n nodes is always true?

A It has n edges B It has 2n edges C It can have n+1 edges D It has exactly n-1 edges