Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Both Queue and Stack
Heap
Stack
Queue
What is the maximum number of children a node can have in a binary tree?
2
Unlimited
3
1
What is the maximum number of nodes at level 'l' of a complete binary tree?
2l - 1
2^(l+1) - 1
l
2^l
What are the three main methods for traversing a binary tree?
Ascending, Descending, Random
Linear, Binary, Exponential
Breadth-first, Depth-first, Level-order
Preorder, Inorder, Postorder
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 a common real-world application of binary trees?
Implementing algorithms like Huffman coding
Storing sorted data for efficient retrieval
Representing hierarchical relationships, like file systems
All of the above
What is the process of adding a new node to a binary tree called?
Insertion
Traversal
Deletion
Searching
Which traversal technique is typically used to find the minimum element in a binary search tree?
Postorder Traversal
Level Order Traversal
Preorder Traversal
Inorder Traversal
What is the time complexity of finding the minimum value in a BST?
O(n)
It depends on the balancing of the tree.
O(log n)
O(1)
In the context of binary trees, what does 'BST' stand for?
Balanced Search Tree
Binary Sorted Tree
Basic Structure Tree
Binary Search Tree