Can a binary tree be empty?
No
Only if it has a root node
Only if it has leaf nodes
Yes
In the context of BST insertion, where is a new node with a key smaller than all existing keys typically inserted?
The position depends on the specific implementation
As the new root
As the left child of the leftmost node
As the right child of the rightmost node
What is the maximum number of children a node can have in a binary tree?
1
Unlimited
2
3
The height of a binary tree with 'n' nodes is always:
floor(log2(n)) + 1
log2(n)
Cannot be determined from the number of nodes
n/2
The path from the root to any node in a binary tree is always:
Disconnected
Circular
Non-unique
Unique
What is one way to check the validity of a BST during insertion or deletion operations?
Checking the BST property locally during the insertion or deletion process
It's not possible to ensure validity during the operations themselves.
Performing a full tree traversal after every operation
Maintaining a separate sorted array to compare with the BST
In the context of binary trees, what does 'BST' stand for?
Balanced Search Tree
Binary Sorted Tree
Binary Search Tree
Basic Structure Tree
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs offer faster search times.
BSTs are easier to implement.
BSTs use less memory.
BSTs handle insertions and deletions more efficiently.
What is the maximum number of nodes at level 'l' of a complete binary tree?
2^l
2l - 1
2^(l+1) - 1
l
Which of the following is a valid approach for deleting a node with two children in a binary tree?
Simply remove the node
Replace the node with its inorder successor
Swap the node with its parent
None of the above