What is the minimum possible height of a binary tree with 5 nodes?
2
1
5
3
The path from the root to any node in a binary tree is always:
Non-unique
Unique
Circular
Disconnected
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Postorder Traversal
Inorder Traversal
Any traversal method can be used
Preorder Traversal
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 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
What is the process of adding a new node to a binary tree called?
Insertion
Searching
Deletion
Traversal
Which traversal technique is typically used to find the minimum element in a binary search tree?
Level Order Traversal
What is the maximum number of children a node can have in a binary tree?
Unlimited
Which data structure is commonly used to implement a binary tree?
Queue
Linked List
Array
Stack
If a binary tree is NOT a BST, can we still find a specific element in it?
Yes, but only if the tree is balanced.
Yes, but it would be less efficient than searching in a BST.
No, searching is only defined for BSTs.
Yes, but we would need to use a brute-force search algorithm.