A node's direct descendant in a binary tree is called its:
Child
Parent
Sibling
Ancestor
What is the minimum possible height of a binary tree with 5 nodes?
1
3
2
5
What is the time complexity of inserting a node into a binary search tree in the worst case?
O(log n)
O(1)
O(n)
O(n log n)
When deleting a node with two children in a BST, which node is typically chosen as its replacement to maintain the BST properties?
Either of the above options can be used
The node with the largest key in the left subtree
The node with the smallest key in the right subtree
A new node with the average key of its children
What is a common real-world application of binary trees?
All of the above
Representing hierarchical relationships, like file systems
Storing sorted data for efficient retrieval
Implementing algorithms like Huffman coding
If a binary tree is NOT a BST, can we still find a specific element in it?
Yes, but we would need to use a brute-force search algorithm.
Yes, but only if the tree is balanced.
No, searching is only defined for BSTs.
Yes, but it would be less efficient than searching in a BST.
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.
Maintaining a separate sorted array to compare with the BST
Checking the BST property locally during the insertion or deletion process
Performing a full tree traversal after every operation
In the context of binary trees, what does 'BST' stand for?
Basic Structure Tree
Balanced Search Tree
Binary Search Tree
Binary Sorted Tree
Which traversal technique is typically used to find the minimum element in a binary search tree?
Postorder Traversal
Level Order Traversal
Inorder Traversal
Preorder Traversal
The height of a binary tree with 'n' nodes is always:
Cannot be determined from the number of nodes
n/2
floor(log2(n)) + 1
log2(n)