What is the time complexity of finding the minimum value in a BST?
It depends on the balancing of the tree.
O(n)
O(1)
O(log n)
Which data structure is commonly used to implement a binary tree?
Array
Queue
Linked List
Stack
What is the process of adding a new node to a binary tree called?
Insertion
Deletion
Traversal
Searching
What is a common real-world application of binary trees?
Implementing algorithms like Huffman coding
Representing hierarchical relationships, like file systems
All of the above
Storing sorted data for efficient retrieval
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.
One subtree is always a mirror image of the other.
They have the same height.
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 we would need to use a brute-force search algorithm.
No, searching is only defined for BSTs.
Yes, but only if the tree is balanced.
Nodes that share the same parent are called:
Descendants
Cousins
Siblings
Ancestors
In a binary tree, what is the depth of a node?
The length of the path from the root to that node.
The number of children the node has.
The height of the subtree rooted at that node.
The number of nodes at the same level as the node.
What are the three main methods for traversing a binary tree?
Breadth-first, Depth-first, Level-order
Preorder, Inorder, Postorder
Linear, Binary, Exponential
Ascending, Descending, Random
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
Any traversal method can be used
Preorder Traversal
Postorder Traversal