Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Heap
Both Queue and Stack
Stack
Queue
Which traversal technique is typically used to find the minimum element in a binary search tree?
Inorder Traversal
Preorder Traversal
Postorder Traversal
Level Order Traversal
What is the time complexity of finding the minimum value in a BST?
O(1)
O(log n)
O(n)
It depends on the balancing of the tree.
A complete binary tree with 'n' nodes will always have a height of:
floor(log2(n)) + 1
n/2
n
log2(n)
A node's direct descendant in a binary tree is called its:
Ancestor
Sibling
Child
Parent
What are the three main methods for traversing a binary tree?
Preorder, Inorder, Postorder
Breadth-first, Depth-first, Level-order
Ascending, Descending, Random
Linear, Binary, Exponential
What is the maximum number of children a node can have in a binary tree?
1
2
3
Unlimited
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
None of the above
Replace the node with its inorder successor
Simply remove the node
If a binary tree is NOT a BST, can we still find a specific element in it?
No, searching is only defined for BSTs.
Yes, but only if the tree is balanced.
Yes, but it would be less efficient than searching in a BST.
Yes, but we would need to use a brute-force search algorithm.
What is the maximum number of nodes at level 'l' of a complete binary tree?
2^l
2^(l+1) - 1
l
2l - 1