What is the process of adding a new node to a binary tree called?
Insertion
Searching
Deletion
Traversal
Which data structure is commonly used to implement a binary tree?
Stack
Linked List
Queue
Array
What is the time complexity of finding the minimum value in a BST?
O(1)
O(n)
It depends on the balancing of the tree.
O(log n)
Which traversal method on a BST will visit the nodes in ascending order of their keys?
Pre-order Traversal
In-order Traversal
Post-order Traversal
Level-order Traversal
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
They are also balanced binary trees, and their heights differ by at most 1.
One subtree is always a mirror image of the other.
They have the same number of nodes.
They have the same height.
In the context of BST insertion, where is a new node with a key smaller than all existing keys typically inserted?
As the new root
The position depends on the specific implementation
As the left child of the leftmost node
As the right child of the rightmost node
Can a binary tree be empty?
Only if it has leaf nodes
Only if it has a root node
Yes
No
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 only if the tree is balanced.
Yes, but we would need to use a brute-force search algorithm.
No, searching is only defined for BSTs.
What is the maximum number of children a node can have in a binary tree?
Unlimited
3
1
2
Which traversal technique is typically used to find the minimum element in a binary search tree?
Inorder Traversal
Level Order Traversal
Postorder Traversal
Preorder Traversal