In the context of BST insertion, where is a new node with a key smaller than all existing keys typically inserted?
As the right child of the rightmost node
As the left child of the leftmost node
As the new root
The position depends on the specific implementation
What is the maximum number of nodes at level 'l' of a complete binary tree?
2l - 1
2^l
2^(l+1) - 1
l
The height of a binary tree with 'n' nodes is always:
floor(log2(n)) + 1
Cannot be determined from the number of nodes
log2(n)
n/2
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.
Maintaining a separate sorted array to compare with the BST
Performing a full tree traversal after every operation
What is the process of adding a new node to a binary tree called?
Searching
Traversal
Deletion
Insertion
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
They have the same number of nodes.
One subtree is always a mirror image of the other.
They have the same height.
They are also balanced binary trees, and their heights differ by at most 1.
Can a binary tree be empty?
Only if it has leaf nodes
No
Yes
Only if it has a root node
Which data structure is commonly used to implement a binary tree?
Stack
Array
Queue
Linked List
What are the three main methods for traversing a binary tree?
Linear, Binary, Exponential
Ascending, Descending, Random
Preorder, Inorder, Postorder
Breadth-first, Depth-first, Level-order
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs are easier to implement.
BSTs handle insertions and deletions more efficiently.
BSTs offer faster search times.
BSTs use less memory.