The height of a binary tree with 'n' nodes is always:
Cannot be determined from the number of nodes
n/2
log2(n)
floor(log2(n)) + 1
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 are the three main methods for traversing a binary tree?
Preorder, Inorder, Postorder
Breadth-first, Depth-first, Level-order
Linear, Binary, Exponential
Ascending, Descending, Random
Which data structure is commonly used to implement a binary tree?
Stack
Array
Linked List
Queue
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs use less memory.
BSTs are easier to implement.
BSTs offer faster search times.
BSTs handle insertions and deletions more efficiently.
What is the minimum possible height of a binary tree with 5 nodes?
2
5
1
3
What is the size of a binary tree with only a root node?
0
Undefined
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 left child of the leftmost node
As the new root
What is the time complexity of finding the minimum value in a BST?
O(1)
O(n)
It depends on the balancing of the tree.
O(log n)
Which traversal method on a BST will visit the nodes in ascending order of their keys?
In-order Traversal
Post-order Traversal
Pre-order Traversal
Level-order Traversal