What is the maximum number of nodes at level 'l' of a complete binary tree?
l
2l - 1
2^l
2^(l+1) - 1
What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(n)
O(log n)
O(n^2)
O(1)
What is the minimum possible height of a binary tree with 5 nodes?
3
5
1
2
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:
Circular
Disconnected
Non-unique
Unique
What is the process of adding a new node to a binary tree called?
Insertion
Searching
Deletion
Traversal
Which traversal method on a BST will visit the nodes in ascending order of their keys?
Level-order Traversal
Pre-order Traversal
Post-order Traversal
In-order Traversal
Can a binary tree be empty?
Only if it has leaf nodes
Only if it has a root node
No
Yes
What is one way to check the validity of a BST during insertion or deletion operations?
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
Checking the BST property locally during the insertion or deletion process
What is the maximum possible height of a balanced binary tree with 7 nodes?
7
4