What is the maximum number of children a node can have in a binary tree?
2
1
Unlimited
3
When deleting a node with two children in a BST, which node is typically chosen as its replacement to maintain the BST properties?
The node with the largest key in the left subtree
The node with the smallest key in the right subtree
A new node with the average key of its children
Either of the above options can be used
In a binary tree, what is the depth of a node?
The height of the subtree rooted at that node.
The number of nodes at the same level as the node.
The length of the path from the root to that node.
The number of children the node has.
What is the maximum number of nodes at level 'l' of a complete binary tree?
2^(l+1) - 1
2l - 1
l
2^l
What is the size of a binary tree with only a root node?
0
Undefined
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.
Which traversal technique is typically used to find the minimum element in a binary search tree?
Postorder Traversal
Level Order Traversal
Inorder Traversal
Preorder Traversal
What is one way to check the validity of a BST during insertion or deletion operations?
Maintaining a separate sorted array to compare with the BST
Performing a full tree traversal after every operation
It's not possible to ensure validity during the operations themselves.
Checking the BST property locally during the insertion or deletion process
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
The position depends on the specific implementation
As the new root
As the left child of the leftmost node
The path from the root to any node in a binary tree is always:
Disconnected
Circular
Non-unique
Unique