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
As the left child of the leftmost node
As the right child of the rightmost node
The position depends on the specific implementation
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 we would need to use a brute-force search algorithm.
Yes, but only if the tree is balanced.
Yes, but it would be less efficient than searching in a BST.
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Inorder Traversal
Preorder Traversal
Postorder Traversal
Any traversal method can be used
What is the maximum number of children a node can have in a binary tree?
1
Unlimited
2
3
Can a binary tree be empty?
Yes
Only if it has a root node
Only if it has leaf nodes
No
The path from the root to any node in a binary tree is always:
Non-unique
Disconnected
Circular
Unique
What is the minimum possible height of a binary tree with 5 nodes?
5
What is the maximum possible height of a balanced binary tree with 7 nodes?
7
4
Which traversal method on a BST will visit the nodes in ascending order of their keys?
Post-order Traversal
Level-order Traversal
In-order Traversal
Pre-order Traversal
Which traversal technique is typically used to find the minimum element in a binary search tree?
Level Order Traversal