WorksheetsLH94_Quiz2
Total questions: 10
Worksheet time: 5mins
In a full binary tree, every node has either:
Zero children
Two children
Zero or two children
At least one child
A complete binary tree is one in which:
All leaves are at the same level
Every level, except possibly the last, is completely filled
It is height balanced
It contains no null links
Which traversal is used to get prefix expressions from an expression tree?
Inorder
Postorder
Preorder
Level order
Preorder traversal of a binary tree visits nodes in the order:
Root → Left → Right
Left → Root → Right
Left → Right → Root
Root → Right → Left
The main purpose of a threaded binary tree is to:
Reduce height
Reduce null links and allow faster traversal
Store duplicates
Increase balance
In a threaded binary tree, an inorder successor of a node is found using:
Right thread
Left thread
Stack
Queue
In a Binary Search Tree, the right child contains:
Values smaller than root
Values greater than root
Values equal to root
Random values
In an undirected graph, each edge contributes to the degree of:
One vertex
Two vertices
No vertex
Multiple vertices
The degree of a vertex in a graph is:
Number of loops
Number of edges incident on it
Number of vertices connected to it
Both B and C
Which data structure is best for representing disjoint sets when both union and find operations are frequent?
Array
Linked list
Tree with path compression and union by rank
Stack
