If a binary tree is NOT a BST, can we still find a specific element in it?
Yes, but it would be less efficient than searching in a BST.
Yes, but we would need to use a brute-force search algorithm.
Yes, but only if the tree is balanced.
No, searching is only defined for BSTs.
What is the size of a binary tree with only a root node?
0
1
Undefined
2
Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Heap
Stack
Both Queue and Stack
Queue
In a binary tree, what is the depth of a node?
The height of the subtree rooted at that node.
The number of nodes at the same level as the node.
The length of the path from the root to that node.
The number of children the node has.
A node's direct descendant in a binary tree is called its:
Parent
Sibling
Child
Ancestor
Which traversal technique is typically used to find the minimum element in a binary search tree?
Preorder Traversal
Postorder Traversal
Level Order Traversal
Inorder Traversal
Which traversal method on a BST will visit the nodes in ascending order of their keys?
Level-order Traversal
Pre-order Traversal
Post-order Traversal
In-order Traversal
A complete binary tree with 'n' nodes will always have a height of:
n/2
floor(log2(n)) + 1
log2(n)
n
What is the maximum possible height of a balanced binary tree with 7 nodes?
7
3
4
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 handle insertions and deletions more efficiently.
BSTs are easier to implement.