What is the maximum number of children a node can have in a binary tree?
2
3
1
Unlimited
What is the time complexity of finding the minimum value in a BST?
O(1)
It depends on the balancing of the tree.
O(n)
O(log n)
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Inorder Traversal
Postorder Traversal
Preorder Traversal
Any traversal method can be used
Can a binary tree be empty?
Only if it has leaf nodes
Yes
Only if it has a root node
No
What is the minimum possible height of a binary tree with 5 nodes?
5
In a binary tree, where is a new node typically inserted?
As the root node
It depends on the data
Anywhere, it doesn't matter
As a leaf node
The path from the root to any node in a binary tree is always:
Circular
Disconnected
Non-unique
Unique
What is the size of a binary tree with only a root node?
0
Undefined
Which traversal technique is typically used to find the minimum element in a binary search tree?
Level Order Traversal
In the context of BST insertion, where is a new node with a key smaller than all existing keys typically inserted?
As the left child of the leftmost node
The position depends on the specific implementation
As the right child of the rightmost node
As the new root