Can a binary tree be empty?
Only if it has leaf nodes
Only if it has a root node
Yes
No
What is the size of a binary tree with only a root node?
0
Undefined
1
2
In a binary tree, where is a new node typically inserted?
Anywhere, it doesn't matter
As the root node
As a leaf node
It depends on the data
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs handle insertions and deletions more efficiently.
BSTs use less memory.
BSTs are easier to implement.
BSTs offer faster search times.
What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(n)
O(1)
O(n^2)
O(log n)
The path from the root to any node in a binary tree is always:
Disconnected
Circular
Unique
Non-unique
A complete binary tree with 'n' nodes will always have a height of:
floor(log2(n)) + 1
log2(n)
n/2
n
What is the time complexity of finding the minimum value in a BST?
It depends on the balancing of the tree.
Nodes that share the same parent are called:
Cousins
Siblings
Descendants
Ancestors
The height of a binary tree with 'n' nodes is always:
Cannot be determined from the number of nodes