What is the time complexity of finding the minimum value in a BST?
O(log n)
O(n)
O(1)
It depends on the balancing of the tree.
In a binary tree, what is the depth of a node?
The number of children the node has.
The height of the subtree rooted at that node.
The length of the path from the root to that node.
The number of nodes at the same level as the node.
What are the three main methods for traversing a binary tree?
Preorder, Inorder, Postorder
Linear, Binary, Exponential
Breadth-first, Depth-first, Level-order
Ascending, Descending, Random
What is the process of adding a new node to a binary tree called?
Traversal
Deletion
Insertion
Searching
If a binary tree is NOT a BST, can we still find a specific element in it?
Yes, but we would need to use a brute-force search algorithm.
Yes, but it would be less efficient than searching in a BST.
Yes, but only if the tree is balanced.
No, searching is only defined for BSTs.
Nodes that share the same parent are called:
Cousins
Siblings
Ancestors
Descendants
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Preorder Traversal
Postorder Traversal
Inorder Traversal
Any traversal method can be used
A complete binary tree with 'n' nodes will always have a height of:
log2(n)
n
n/2
floor(log2(n)) + 1
Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Queue
Both Queue and Stack
Stack
Heap
What is the maximum possible height of a balanced binary tree with 7 nodes?
2
7
3
4