The path from the root to any node in a binary tree is always:
Disconnected
Circular
Unique
Non-unique
What is the minimum possible height of a binary tree with 5 nodes?
2
1
5
3
What is the maximum number of nodes at level 'l' of a complete binary tree?
2^(l+1) - 1
2l - 1
l
2^l
Can a binary tree be empty?
Only if it has leaf nodes
Yes
Only if it has a root node
No
What is the size of a binary tree with only a root node?
Undefined
0
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
One subtree is always a mirror image of the other.
They are also balanced binary trees, and their heights differ by at most 1.
They have the same number of nodes.
They have the same height.
What is a common real-world application of binary trees?
Implementing algorithms like Huffman coding
Storing sorted data for efficient retrieval
Representing hierarchical relationships, like file systems
All of the above
Which data structure is commonly used to implement a binary tree?
Array
Stack
Linked List
Queue
What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(1)
O(n)
O(log n)
O(n^2)
Which traversal method on a BST will visit the nodes in ascending order of their keys?
In-order Traversal
Pre-order Traversal
Post-order Traversal
Level-order Traversal