The height of a binary tree with 'n' nodes is always:
n/2
floor(log2(n)) + 1
log2(n)
Cannot be determined from the number of nodes
Which traversal technique is typically used to find the minimum element in a binary search tree?
Inorder Traversal
Preorder Traversal
Level Order Traversal
Postorder Traversal
Which data structure is commonly used to implement a binary tree?
Linked List
Queue
Array
Stack
What is the size of a binary tree with only a root node?
2
0
1
Undefined
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
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.
No, searching is only defined for BSTs.
Yes, but only if the tree is balanced.
Yes, but we would need to use a brute-force search algorithm.
What are the three main methods for traversing a binary tree?
Linear, Binary, Exponential
Preorder, Inorder, Postorder
Breadth-first, Depth-first, Level-order
Ascending, Descending, Random
In the context of binary trees, what does 'BST' stand for?
Binary Sorted Tree
Balanced Search Tree
Binary Search Tree
Basic Structure Tree
When deleting a node with two children in a BST, which node is typically chosen as its replacement to maintain the BST properties?
The node with the largest key in the left subtree
The node with the smallest key in the right subtree
Either of the above options can be used
A new node with the average key of its children
What is the process of adding a new node to a binary tree called?
Deletion
Searching
Insertion
Traversal