The height of a binary tree with 'n' nodes is always:
log2(n)
n/2
floor(log2(n)) + 1
Cannot be determined from the number of nodes
Can a binary tree be empty?
No
Only if it has a root node
Yes
Only if it has leaf nodes
Which traversal method on a BST will visit the nodes in ascending order of their keys?
Post-order Traversal
In-order Traversal
Level-order Traversal
Pre-order Traversal
What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(n^2)
O(1)
O(n)
O(log n)
A node's direct descendant in a binary tree is called its:
Parent
Child
Ancestor
Sibling
Which traversal technique is typically used to find the minimum element in a binary search tree?
Level Order Traversal
Inorder Traversal
Postorder Traversal
Preorder Traversal
In a binary tree, where is a new node typically inserted?
As a leaf node
Anywhere, it doesn't matter
It depends on the data
As the root node
In a binary tree, what is the depth of a node?
The number of nodes at the same level as the node.
The length of the path from the root to that node.
The height of the subtree rooted at that node.
The number of children the node has.
What is the process of adding a new node to a binary tree called?
Insertion
Searching
Traversal
Deletion
What is the maximum possible height of a balanced binary tree with 7 nodes?
7
3
2
4