What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(n)
O(1)
O(log n)
O(n^2)
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
Nodes that share the same parent are called:
Cousins
Siblings
Ancestors
Descendants
When deleting a node with two children in a BST, which node is typically chosen as its replacement to maintain the BST properties?
The node with the largest key in the left subtree
A new node with the average key of its children
The node with the smallest key in the right subtree
Either of the above options can be used
In the context of binary trees, what does 'BST' stand for?
Basic Structure Tree
Binary Sorted Tree
Binary Search Tree
Balanced Search Tree
What is the maximum possible height of a balanced binary tree with 7 nodes?
4
7
3
2
What is the size of a binary tree with only a root node?
0
1
Undefined
What is the maximum number of nodes at level 'l' of a complete binary tree?
2l - 1
l
2^l
2^(l+1) - 1
What is the minimum possible height of a binary tree with 5 nodes?
5
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs handle insertions and deletions more efficiently.
BSTs use less memory.
BSTs are easier to implement.
BSTs offer faster search times.