Which traversal technique is typically used to find the minimum element in a binary search tree?
Level Order Traversal
Postorder Traversal
Preorder Traversal
Inorder Traversal
What is the maximum number of children a node can have in a binary tree?
1
2
3
Unlimited
Nodes that share the same parent are called:
Descendants
Siblings
Cousins
Ancestors
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 offer faster search times.
BSTs are easier to implement.
BSTs handle insertions and deletions more efficiently.
In a binary tree, where is a new node typically inserted?
As a leaf node
Anywhere, it doesn't matter
As the root node
It depends on the data
Which of the following is a valid approach for deleting a node with two children in a binary tree?
Swap the node with its parent
Replace the node with its inorder successor
None of the above
Simply remove the node
What is the time complexity of finding the minimum value in a BST?
O(n)
It depends on the balancing of the tree.
O(1)
O(log n)
If a binary tree is NOT a BST, can we still find a specific element in it?
Yes, but we would need to use a brute-force search algorithm.
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.
The height of a binary tree with 'n' nodes is always:
n/2
log2(n)
Cannot be determined from the number of nodes
floor(log2(n)) + 1
The path from the root to any node in a binary tree is always:
Unique
Non-unique
Disconnected
Circular