Which traversal technique is typically used to find the minimum element in a binary search tree?
Postorder Traversal
Inorder Traversal
Preorder Traversal
Level Order Traversal
In a binary tree, where is a new node typically inserted?
As a leaf node
As the root node
Anywhere, it doesn't matter
It depends on the data
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Any traversal method can be used
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
Replace the node with its inorder successor
None of the above
Simply remove the node
A node's direct descendant in a binary tree is called its:
Ancestor
Parent
Sibling
Child
What is the maximum possible height of a balanced binary tree with 7 nodes?
3
4
2
7
What are the three main methods for traversing a binary tree?
Ascending, Descending, Random
Linear, Binary, Exponential
Breadth-first, Depth-first, Level-order
Preorder, Inorder, Postorder
In a binary tree, what is the depth of a node?
The height of the subtree rooted at that node.
The number of children the node has.
The number of nodes at the same level as the node.
The length of the path from the root to that node.
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
They have the same height.
One subtree is always a mirror image of the other.
They are also balanced binary trees, and their heights differ by at most 1.
They have the same number of nodes.
What is a common real-world application of binary trees?
Implementing algorithms like Huffman coding
All of the above
Representing hierarchical relationships, like file systems
Storing sorted data for efficient retrieval