What is the minimum possible height of a binary tree with 5 nodes?
3
1
2
5
What is the maximum number of nodes at level 'l' of a complete binary tree?
l
2^l
2^(l+1) - 1
2l - 1
In the context of binary trees, what does 'BST' stand for?
Binary Search Tree
Binary Sorted Tree
Balanced Search Tree
Basic Structure Tree
A complete binary tree with 'n' nodes will always have a height of:
n/2
log2(n)
n
floor(log2(n)) + 1
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
Postorder Traversal
Any traversal method can be used
Preorder Traversal
Which data structure is commonly used to implement a binary tree?
Stack
Queue
Array
Linked List
What is the time complexity of finding the minimum value in a BST?
O(1)
O(log n)
It depends on the balancing of the tree.
O(n)
The height of a binary tree with 'n' nodes is always:
Cannot be determined from the number of nodes
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs use less memory.
BSTs offer faster search times.
BSTs are easier to implement.
BSTs handle insertions and deletions more efficiently.
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