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?
Both Queue and Stack
Queue
Heap
Stack
In the context of binary trees, what does 'BST' stand for?
Balanced Search Tree
Binary Search Tree
Binary Sorted Tree
Basic Structure Tree
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.
No, searching is only defined for BSTs.
Yes, but we would need to use a brute-force search algorithm.
Yes, but it would be less efficient than searching in a BST.
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 time complexity of finding the minimum value in a BST?
O(1)
O(n)
O(log n)
It depends on the balancing of the tree.
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs offer faster search times.
BSTs are easier to implement.
BSTs use less memory.
BSTs handle insertions and deletions more efficiently.
What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(n^2)
In a binary tree, what is the depth of a node?
The length of the path from the root to that node.
The height of the subtree rooted at that node.
The number of nodes at the same level as the node.
The number of children the node has.
Which traversal technique is typically used to find the minimum element in a binary search tree?
Level Order Traversal
Postorder Traversal
Inorder Traversal
Preorder Traversal