GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 11-15 of 100

0% completed (0/100 answered)

Question 11

MCQ · Single Correct 1 mark

In a binary tree, which traversal visits the root before both subtrees?

A Level order B Preorder C Postorder D Inorder

MCQ · Single Correct 1 mark

For a binary tree with n nodes, what is the time complexity of a complete traversal?

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

MCQ · Single Correct 1 mark

Which traversal of a BST can be used to output keys in nondecreasing order?

A Postorder B Preorder C Level order D Inorder

MCQ · Single Correct 1 mark

A binary tree has height h. What is the minimum possible number of nodes when h is measured in edges?

A h + 1 B 2h C 1 D $2^h$

MCQ · Single Correct 1 mark

A perfect binary tree has 31 nodes. What is its height when the root has height 0?

A 5 B 4 C 6 D 3