GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 41-45 of 100

0% completed (0/100 answered)

Question 41

MCQ · Single Correct 1 mark

Which property distinguishes a perfect binary tree from a merely complete binary tree?

A Every internal node has two children and all leaves are at the same depth B All leaves are at the same depth C Every node has at most one child D The root must be a leaf

Question 42

MCQ · Single Correct 1 mark

Which data structure is most directly used to implement iterative DFS on a tree?

A Queue B Priority queue C Stack D Hash table

Question 43

MCQ · Single Correct 1 mark

Which data structure is most directly used to implement BFS on a tree?

A Deque only B Hash table C Stack D Queue

Question 44

MCQ · Single Correct 1 mark

What is the height of a single-node binary tree under the edge-based definition?

A 1 B 0 C 1 edge D h

Question 45

MCQ · Single Correct 1 mark

How many edges does a tree with n vertices have?

A n+1 B 2n C n - 1 D n