What is a common real-world application of binary trees?
Representing hierarchical relationships, like file systems
Storing sorted data for efficient retrieval
All of the above
Implementing algorithms like Huffman coding
In the context of binary trees, what does 'BST' stand for?
Binary Search Tree
Binary Sorted Tree
Balanced Search Tree
Basic Structure Tree
What is the minimum possible height of a binary tree with 5 nodes?
3
1
5
2
Nodes that share the same parent are called:
Siblings
Descendants
Ancestors
Cousins
In a binary tree, where is a new node typically inserted?
Anywhere, it doesn't matter
It depends on the data
As the root node
As a leaf node
Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Both Queue and Stack
Heap
Queue
Stack
What is one way to check the validity of a BST during insertion or deletion operations?
It's not possible to ensure validity during the operations themselves.
Performing a full tree traversal after every operation
Maintaining a separate sorted array to compare with the BST
Checking the BST property locally during the insertion or deletion process
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
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 height.
They have the same number of nodes.
A complete binary tree with 'n' nodes will always have a height of:
n
floor(log2(n)) + 1
log2(n)
n/2
Which traversal method on a BST will visit the nodes in ascending order of their keys?
In-order Traversal
Post-order Traversal
Pre-order Traversal
Level-order Traversal