What is the maximum number of nodes at level 'l' of a complete binary tree?
2l - 1
2^(l+1) - 1
l
2^l
Can a binary tree be empty?
Only if it has leaf nodes
Only if it has a root node
No
Yes
What are the three main methods for traversing a binary tree?
Preorder, Inorder, Postorder
Ascending, Descending, Random
Breadth-first, Depth-first, Level-order
Linear, Binary, Exponential
What is a common real-world application of binary trees?
Storing sorted data for efficient retrieval
Implementing algorithms like Huffman coding
All of the above
Representing hierarchical relationships, like file systems
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
A new node with the average key of its children
The node with the smallest key in the right subtree
Either of the above options can be used
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
They are also balanced binary trees, and their heights differ by at most 1.
One subtree is always a mirror image of the other.
They have the same height.
They have the same number of nodes.
Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Queue
Both Queue and Stack
Stack
Heap
What is the size of a binary tree with only a root node?
Undefined
2
0
1
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 new root
As the left child of the leftmost node
The position depends on the specific implementation
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Preorder Traversal
Postorder Traversal
Any traversal method can be used
Inorder Traversal