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.
In a binary tree, where is a new node typically inserted?
As the root node
Anywhere, it doesn't matter
As a leaf node
It depends on the data
What is the maximum number of children a node can have in a binary tree?
2
1
Unlimited
3
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs offer faster search times.
BSTs handle insertions and deletions more efficiently.
BSTs use less memory.
BSTs are easier to implement.
In the context of binary trees, what does 'BST' stand for?
Basic Structure Tree
Binary Sorted Tree
Balanced Search Tree
Binary Search Tree
Which of the following is a valid approach for deleting a node with two children in a binary tree?
Swap the node with its parent
Simply remove the node
None of the above
Replace the node with its inorder successor
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
Any traversal method can be used
Postorder Traversal
Inorder Traversal
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
A new node with the average key of its children
The node with the smallest key in the right subtree
Either of the above options can be used
The height of a binary tree with 'n' nodes is always:
Cannot be determined from the number of nodes
floor(log2(n)) + 1
n/2
log2(n)
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
They have the same number of nodes.
They are also balanced binary trees, and their heights differ by at most 1.
They have the same height.
One subtree is always a mirror image of the other.