WorksheetsPBA 2 MCQ
Total questions: 10
Worksheet time: 5mins
What is a binary tree's minimum possible height or level with 'N' nodes?
Log2(N)
Log2(N + 1)
N
N+1
In a full binary tree if the number of internal nodes is I, then the number of leaves L is____.
L = 2*I
L = I + 1
L = I – 1
L = 2*I – 1
In a non-empty binary tree, if 'n' is the total number of nodes and 'e' is the total number of edges, what is the relationship between 'n' and 'e'?
e = n
e = n + 1
e = 2n
e = n - 1
In a binary tree, the top-most node is called ________.
root
leaf
branch
trunk
A binary tree in which if all its levels, except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible is called
Binary Search Tree
Complete binary tree
Threaded tree
None of the mentioned options
The height of a binary tree is the maximum number of edges in any root-to-leaf path. The maximum number of nodes in a binary tree of height h is:
2h nodes
2h-1 nodes
2(h+1)-1 nodes
2h nodes
Which of the following is a condition that must be satisfied for a Binary Tree to be a Binary Search Tree?
The tree has a height of log(n), where n is the number of nodes
Each node in the tree has at most two children
The value of each node is greater than or equal to the value of its left child and less than or equal to the value of its right child
The tree has a maximum height of n, where n is the number of nodes
Which data structure is used in Breadth First Search?
Queue
Stack
Heap
Linked List
When the Depth First Search of a graph is unique?
When the graph is a Binary Tree
When the graph is a n-ary Tree
When the graph is a Linked List
When the graph is a ternary Tree
In Depth First Search, how many times is a node visited?
Once
Equivalent to number of indegree of the node
Twice
Thrice
